activity
20162025
most citedHigh-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search

2 citations · 5 across the 4 of their papers we have counts for

collaborators
Showing math.OCShow all

11 papers · 1 filter

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.OC20251 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.OC20251 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…

math.OC2024

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope

Alireza Kabgani, Masoud Ahookhosh

This paper introduces ItsOPT, an {\it inexact two-level smoothing optimization framework} designed to find first-order critical points of nonsmooth and nonconvex functions. The fra…

math.OC20212 cited

High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search

Masoud Ahookhosh, Yurii Nesterov

A bi-level optimization framework (BiOPT) was proposed in [3] for convex composite optimization, which is a generalization of bi-level unconstrained minimization framework (BLUM) g…