activity
20242026
most citedItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization

1 citations · 3 across the 11 of their papers we have counts for

collaborators
Showing 2025Show all

6 papers · 1 filter

math.OC2025

On fundamental properties of high-order forward-backward envelope

Alireza Kabgani, Masoud Ahookhosh

This paper studies the fundamental properties of the high-order forward-backward splitting mapping (HiFBS) and its associated high-order forward-backward envelope (HiFBE) through t…

math.OC2025

Minimizing Smooth Kurdyka-Łojasiewicz Functions via Generalized Descent Methods: Convergence Rate and Complexity

Masoud Ahookhosh, Susan Ghaderi, Alireza Kabgani +1

This paper introduces a generalized descent algorithm (DEAL) for minimizing smooth nonconvex functions. If the objective function is nonsmooth, a smoothing technique (e.g., forward…

math.OC2025

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method

Alireza Kabgani, Masoud Ahookhosh

This paper introduces a first-order majorization-minimization framework based on a high-order majorant for continuous functions, incorporating a non-quadratic regularization term o…

math.OC2025★ 1 cited

Asymptotic Convergence Analysis of High-Order Proximal-Point Methods Beyond Sublinear Rates

Masoud Ahookhosh, Alfredo Iusem, Alireza Kabgani +1

This paper investigates the asymptotic convergence behavior of the high-order proximal-point algorithm (HiPPA) to global minimizers, extending existing analyses beyond sublinear co…

math.OC2025

Moreau envelope and proximal-point methods under the lens of high-order regularization

Alireza Kabgani, Masoud Ahookhosh

This paper is devoted to investigating the fundamental properties of the high-order proximal operator (HOPE) and the high-order Moreau envelope (HOME) in the nonconvex setting, whe…

math.OC2025★ 1 cited

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization

Alireza Kabgani, Masoud Ahookhosh

This paper deals with nonconvex optimization problems via a two-level smoothing framework in which the high-order Moreau envelope (HOME) is applied to generate a smooth approximati…