Cover Image

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ghaderi, Susan, Rahimi, Morteza, Moreau, Yves, Ahookhosh, Masoud
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C06, 90C25, 90C26, 49J52, 49J53
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness
by: Wang, Ziyuan, et al.
Published: (2022)

Isolated calmness of perturbation mappings in generalized nonlinear programming and local superlinear convergence of Newton-type methods
by: Benko, Matúš, et al.
Published: (2024)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

Directional Subdifferentials at Infinity and Its Applications
by: Kien, Le Ngoc, et al.
Published: (2025)

Stationarity in nonsmooth optimization between geometrical motivation and topological relevance
by: Shikhman, Vladimir
Published: (2024)

The Least Singular Value Function in Variational Analysis
by: Jelitte, Mario, et al.
Published: (2025)

Approximate directional stationarity and associated qualification conditions
by: Käming, Isabella, et al.
Published: (2026)

Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
by: Huyen, Luu Thi Thu, et al.
Published: (2026)

On the directional asymptotic approach in optimization theory
by: Benko, Matúš, et al.
Published: (2024)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
by: Kabgani, Alireza, et al.
Published: (2025)

Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)

An augmented Lagrangian method for strongly regular minimizers in a class of convex composite optimization problems
by: Wang, Chengjing, et al.
Published: (2025)

Isolated Calmness in Regularized Convex Optimization
by: Nghia, Tran T. A., et al.
Published: (2026)

Geometric characterizations of Lipschitz stability for convex optimization problems
by: Nghia, Tran T. A.
Published: (2024)

Lipschitz stability of least-squares problems regularized by functions with $\mathcal{C}^2$-cone reducible conjugates
by: Cui, Ying, et al.
Published: (2024)

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
by: An, Duong Thi Viet, et al.
Published: (2024)

Two Typical Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
by: Chen, Liang, et al.
Published: (2024)

Tilt stability of Ky-Fan $κ$-norm composite optimization
by: Liu, Yulan, et al.
Published: (2024)

Primal and dual characterizations of sign-symmetric norms
by: Cuong, Nguyen Duy
Published: (2025)

On second-order Karush--Kuhn--Tucker optimality conditions for $C^{1,1}$ vector optimization problems
by: Van Tuyen, Nguyen
Published: (2025)

Perturbation analysis of a class of composite optimization problems
by: Tang, Peipei, et al.
Published: (2024)

Approximation Analysis of the Entropic Penalty in Quadratic Programming
by: Karumanchi, Venkatkrishna, et al.
Published: (2025)

Stable Recovery of Regularized Linear Inverse Problems
by: Nghia, Tran T. A., et al.
Published: (2024)

Convergence Rates for the Alternating Minimization Algorithm in Structured Nonsmooth and Nonconvex Optimization
by: Bento, Glaydston C., et al.
Published: (2026)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
by: Lara, Felipe, et al.
Published: (2024)

A note on the uniformity of strong subregularity around the reference point
by: Roubal, Tomáš
Published: (2025)

Duality Theory on Vector Spaces
by: Van Cuong, Dang, et al.
Published: (2023)

Characterizations of the Aubin property of the KKT-mapping in composite optimization by SC derivatives and quadratic bundles
by: Gfrerer, Helmut, et al.
Published: (2026)

On second-order variational analysis of variational convexity of prox-regular functions
by: Gfrerer, Helmut
Published: (2024)

Regular Subgradients of Marginal Functions with Applications to Calculus and Bilevel Programming
by: Hai, Le Phuoc, et al.
Published: (2024)

Generalized Twice Differentiability and Quadratic Bundles in Second-Order Variational Analysis
by: Khanh, Pham Duy, et al.
Published: (2025)