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

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

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

scientific article; zbMATH DE number 7594342

Language	Label	Description	Also known as
default for all languages	No label defined
English	Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity	scientific article; zbMATH DE number 7594342

Statements

instance of

scholarly article

0 references

title

Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity (English)

0 references

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

29 September 2022

0 references

full work available at URL

https://arxiv.org/abs/2102.10312

0 references

zbMATH Keywords

nonsmooth nonconvex optimization

0 references

incremental aggregated algorithms

0 references

Bregman-Moreau envelope

0 references

KL inequality

0 references

cites work

Saga

0 references

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

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity

0 references

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

0 references

Q4347616

0 references

ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES

0 references

First-order methods in optimization

0 references

Mirror descent and nonlinear projected subgradient methods for convex optimization.

0 references

On the convergence of block coordinate descent type methods

0 references

Incremental proximal methods for large scale convex optimization

0 references

Convex optimization theory.

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

Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications

0 references

The nonsmooth landscape of phase retrieval

0 references

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

0 references

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

0 references

Fastest rates for stochastic mirror descent methods

0 references

Iteration complexity analysis of block coordinate descent methods

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

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems

0 references

On semi- and subanalytic geometry

0 references

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

0 references

Optical Wavefront Reconstruction: Theory and Numerical Methods

0 references

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

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

Robust Stochastic Approximation Approach to Stochastic Programming

0 references

Efficiency of coordinate descent methods on huge-scale optimization problems

0 references

Non-smooth non-convex Bregman minimization: unification and new algorithms

0 references

Convex Analysis

0 references

Minimizing finite sums with the stochastic average gradient

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

Convergence of a block coordinate descent method for nondifferentiable minimization

0 references

Relaxation methods for problems with strictly convex separable costs and linear constraints

0 references

A coordinate gradient descent method for nonsmooth separable minimization

0 references

Incrementally updated gradient methods for constrained and regularized optimization

0 references

Global convergence rate of proximal incremental aggregated gradient methods

0 references

A proximal stochastic gradient method with progressive variance reduction

0 references

A globally convergent algorithm for nonconvex optimization based on block coordinate update

0 references

Kurdyka-Łojasiewicz exponent via inf-projection

0 references

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

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

Identifiers

zbMATH Open document ID

1501.90073

0 references

DOI

10.1137/21M140376X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

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