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

15 papers

math.OC2026

Multi-rate high-order regularization with an order- oracle

Alireza Kabgani

We consider unconstrained minimization of a possibly nonconvex function whose th derivative is Lipschitz continuous, with , when derivative…

math.OC2026

Tensor Envelopes in the Nonconvex Setting

Alireza Kabgani, Masoud Ahookhosh

We introduce a tensor envelope (TEE) for composite objectives , built from a th-order Taylor model of the smooth term regularized by a th power with . To cons…

cs.LG2026

Beyond Conventional Federated Learning via High-Order Regularization

Alireza Kabgani, Masoud Ahookhosh

Federated clients that perform several local optimization steps can return parameter displacements with widely different magnitudes. The quadratic regularization of FedProx grows l…

math.OC2026

Difference-of-Convex Optimization via Inexact Smoothing Descent Methods: Difference of High-Order Moreau Envelopes

Alireza Kabgani, Moslem Zamani, Masoud Ahookhosh

This paper studies difference-of-convex (DC) optimization problems through smoothing descent techniques. In particular, we introduce the difference of high-order Moreau envelopes (…

math.OC2026

Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm

Susan Ghaderi, Alireza Kabgani, Yves Moreau +1

We study sampling from posterior distributions with nonsmooth composite potentials, a setting in which proximal-based Langevin methods are theoretically appealing but in practice l…

math.OC2026

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods

Alireza Kabgani, Felipe Lara, Masoud Ahookhosh

Robust learning aims to maintain model performance under noise, corruption, and distributional shifts, which are prevalent in modern machine learning applications. This work shows…

math.ST2026

Weak-Curvature AMISE and Plug-in Bandwidth Selection for Kernel Density Estimation

Alireza Kabgani, Elaheh Lotfian

Kernel density estimation risk expansions are commonly expressed through the integrated squared curvature term that enters second-order AMISE and plug-in bandwidth rules. This pape…

math.OC2026

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods

Masoud Ahookhosh, Jose M. M. de Brito, Alireza Kabgani +2

We study the optimization of (strongly) quasar-convex functions, a class that arises naturally in many machine learning and data science applications due to its favorable propertie…

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 addresses nonconvex optimization problems via a two-level smoothing framework, where the high-order Moreau envelope (HOME) provides a smooth approximation of weakly conv…

math.OC2024★ 1 cited

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…