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

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

Authors: Pourya Behmandpoor, Puya Latafat, Andreas Themelis, M. Moonen, Panagiotis Patrinos 

Publication date: 7 May 2024

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• An interior proximal gradient method for nonconvex optimization

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6498409)