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

scientific article; zbMATH DE number 7843786

Language	Label	Description	Also known as
default for all languages	No label defined
English	SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization	scientific article; zbMATH DE number 7843786

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

7 May 2024

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima

0 references

Local convergence of quasi-Newton methods under metric regularity

0 references

A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications

0 references

Mirror descent and nonlinear projected subgradient methods for convex optimization.

0 references

Nonlinear programming

0 references

Gradient Convergence in Gradient methods with Errors

0 references

A Convergent Incremental Gradient Method with a Constant Step Size

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

Clarke Subgradients of Stratifiable Functions

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems

0 references

Phase retrieval via Wirtinger flow: theory and algorithms

0 references

Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions

0 references

Proximal gradient algorithms under local Lipschitz gradient continuity. A convergence and robustness analysis of PANOC

0 references

A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods

0 references

Quasi-Newton Methods, Motivation and Theory

0 references

Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming

0 references

Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization

0 references

Why random reshuffling beats stochastic gradient descent

0 references

The elements of statistical learning. Data mining, inference, and prediction

0 references

The Moreau envelope function and proximal mapping in the sense of the Bregman distance

0 references

On gradients of functions definable in o-minimal structures

0 references

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity

0 references

Relatively smooth convex optimization by first-order methods, and applications

0 references

Incremental majorization-minimization optimization with application to large-scale machine learning

0 references

IQN: an incremental quasi-Newton method with local superlinear convergence rate

0 references

Surpassing gradient descent provably: a cyclic incremental method with linear convergence rate

0 references

On stochastic subgradient mirror-descent algorithm with weighted averaging

0 references

Gradient methods for minimizing composite functions

0 references

Lectures on convex optimization

0 references

Q4969178

0 references

Parallel stochastic gradient algorithms for large-scale matrix completion

0 references

Convex Analysis

0 references

Minimizing finite sums with the stochastic average gradient

0 references

Stochastic dual coordinate ascent methods for regularized loss minimization

0 references

An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions

0 references

A geometric analysis of phase retrieval

0 references

A simplified view of first order methods for optimization

0 references

SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators

0 references

Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms

0 references

Global convergence rate of proximal incremental aggregated gradient methods

0 references

Proximal-like incremental aggregated gradient method with linear convergence under Bregman distance growth conditions

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S10589-023-00550-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6498409