SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
From MaRDI portal
Publication:6498409
Recommendations
- Nonconvex proximal incremental aggregated gradient method with linear convergence
- Stochastic proximal difference-of-convex algorithm with SPIDER for a class of nonconvex nonsmooth regularized problems
- Linear convergence of proximal incremental aggregated gradient method for nonconvex nonsmooth minimization problems
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Global convergence analysis of sparse regular nonconvex optimization problems
Cites work
- scientific article; zbMATH DE number 7255141 (Why is no real title available?)
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Convergent Incremental Gradient Method with a Constant Step Size
- 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
- An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
- Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
- Clarke Subgradients of Stratifiable Functions
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convex Analysis
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- 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
- Global convergence rate of proximal incremental aggregated gradient methods
- Gradient Convergence in Gradient methods with Errors
- Gradient methods for minimizing composite functions
- IQN: an incremental quasi-Newton method with local superlinear convergence rate
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Lectures on convex optimization
- Local convergence of quasi-Newton methods under metric regularity
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Minimizing finite sums with the stochastic average gradient
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Nonlinear programming
- On gradients of functions definable in o-minimal structures
- On stochastic subgradient mirror-descent algorithm with weighted averaging
- Parallel stochastic gradient algorithms for large-scale matrix completion
- Phase retrieval via Wirtinger flow: theory and algorithms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC
- Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions
- Quasi-Newton Methods, Motivation and Theory
- Relatively smooth convex optimization by first-order methods, and applications
- Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic dual coordinate ascent methods for regularized loss minimization
- SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators
- Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate
- The Moreau envelope function and proximal mapping in the sense of the Bregman distance
- The elements of statistical learning. Data mining, inference, and prediction
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Why random reshuffling beats stochastic gradient descent
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)
