Image de couverture de livre

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Behmandpoor, Pourya, Latafat, Puya, Themelis, Andreas, Moonen, Marc, Patrinos, Panagiotis
Format:	Preprint
Publié:	2022
Sujets:	Optimization and Control Machine Learning 90C06, 90C25, 90C26, 49J52, 49J53, 90C53
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
par: Latafat, Puya, et autres
Publié: (2019)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
par: Latafat, Puya, et autres
Publié: (2021)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
par: Ahookhosh, Masoud, et autres
Publié: (2019)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
par: Themelis, Andreas, et autres
Publié: (2020)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
par: Bodard, Alexander, et autres
Publié: (2026)

A quadratically convergent proximal algorithm for nonnegative tensor decomposition
par: Vervliet, Nico, et autres
Publié: (2020)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
par: Hermans, Ben, et autres
Publié: (2020)

A penalty barrier framework for nonconvex constrained optimization
par: De Marchi, Alberto, et autres
Publié: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
par: Ghaderi, Susan, et autres
Publié: (2025)

A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness
par: Wang, Ziyuan, et autres
Publié: (2022)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
par: Van Tuyen, Nguyen, et autres
Publié: (2024)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
par: Rahimi, Morteza, et autres
Publié: (2024)

Isolated calmness of perturbation mappings in generalized nonlinear programming and local superlinear convergence of Newton-type methods
par: Benko, Matúš, et autres
Publié: (2024)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
par: Kabgani, Alireza, et autres
Publié: (2024)

Directional Subdifferentials at Infinity and Its Applications
par: Kien, Le Ngoc, et autres
Publié: (2025)

Stationarity in nonsmooth optimization between geometrical motivation and topological relevance
par: Shikhman, Vladimir
Publié: (2024)

The Least Singular Value Function in Variational Analysis
par: Jelitte, Mario, et autres
Publié: (2025)

Approximate directional stationarity and associated qualification conditions
par: Käming, Isabella, et autres
Publié: (2026)

Spingarn's Method and Progressive Decoupling Beyond Elicitable Monotonicity
par: Evens, Brecht, et autres
Publié: (2025)

Convergence of the Chambolle-Pock Algorithm in the Absence of Monotonicity
par: Evens, Brecht, et autres
Publié: (2023)

Local properties and augmented Lagrangians in fully nonconvex composite optimization
par: De Marchi, Alberto, et autres
Publié: (2023)

Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
par: Huyen, Luu Thi Thu, et autres
Publié: (2026)

On the directional asymptotic approach in optimization theory
par: Benko, Matúš, et autres
Publié: (2024)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
par: Kabgani, Alireza, et autres
Publié: (2025)

An augmented Lagrangian method for strongly regular minimizers in a class of convex composite optimization problems
par: Wang, Chengjing, et autres
Publié: (2025)

Isolated Calmness in Regularized Convex Optimization
par: Nghia, Tran T. A., et autres
Publié: (2026)

Geometric characterizations of Lipschitz stability for convex optimization problems
par: Nghia, Tran T. A.
Publié: (2024)

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

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
par: An, Duong Thi Viet, et autres
Publié: (2024)

Two Typical Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
par: Chen, Liang, et autres
Publié: (2024)

Tilt stability of Ky-Fan $κ$-norm composite optimization
par: Liu, Yulan, et autres
Publié: (2024)

Primal and dual characterizations of sign-symmetric norms
par: Cuong, Nguyen Duy
Publié: (2025)

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

Perturbation analysis of a class of composite optimization problems
par: Tang, Peipei, et autres
Publié: (2024)

Approximation Analysis of the Entropic Penalty in Quadratic Programming
par: Karumanchi, Venkatkrishna, et autres
Publié: (2025)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
par: Latafat, Puya, et autres
Publié: (2023)

Convergence of the Preconditioned Proximal Point Method and Douglas-Rachford Splitting in the Absence of Monotonicity
par: Evens, Brecht, et autres
Publié: (2023)

Convergence Rates for the Alternating Minimization Algorithm in Structured Nonsmooth and Nonconvex Optimization
par: Bento, Glaydston C., et autres
Publié: (2026)

Stable Recovery of Regularized Linear Inverse Problems
par: Nghia, Tran T. A., et autres
Publié: (2024)

On the existence and the stability of solutions in nonconvex vector optimization
par: Van Nghi, Tran, et autres
Publié: (2025)