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

DOI10.1007/S10589-023-00550-8MaRDI QIDQ6498409

Andreas Themelis, Pourya Behmandpoor, Panagiotis Patrinos, Puya Latafat, Marc Moonen

Publication date: 7 May 2024

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Methods of quasi-Newton type (90C53) Set-valued and variational analysis (49J53)

Cites Work

Unnamed Item
Unnamed Item
Gradient methods for minimizing composite functions
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Minimizing finite sums with the stochastic average gradient
The Moreau envelope function and proximal mapping in the sense of the Bregman distance
Lectures on convex optimization
On gradients of functions definable in o-minimal structures
A simplified view of first order methods for optimization
A geometric analysis of phase retrieval
Mirror descent and nonlinear projected subgradient methods for convex optimization.
Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
Why random reshuffling beats stochastic gradient descent
Parallel stochastic gradient algorithms for large-scale matrix completion
Local convergence of quasi-Newton methods under metric regularity
An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
Phase Retrieval via Wirtinger Flow: Theory and Algorithms
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
Clarke Subgradients of Stratifiable Functions
Quasi-Newton Methods, Motivation and Theory
Gradient Convergence in Gradient methods with Errors
First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms
Relatively Smooth Convex Optimization by First-Order Methods, and Applications
Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods
Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate
A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
Finite-Dimensional Variational Inequalities and Complementarity Problems
On Stochastic Subgradient Mirror-Descent Algorithm with Weighted Averaging
Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions
Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators
Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
A Convergent Incremental Gradient Method with a Constant Step Size
Convex Analysis
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
IQN: An Incremental Quasi-Newton Method with Local Superlinear Convergence Rate
A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity
The elements of statistical learning. Data mining, inference, and prediction
Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization

This page was built for publication: SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization