A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567): Difference between revisions

Latest revision as of 09:26, 30 July 2024

scientific article; zbMATH DE number 7319278

Language	Label	Description	Also known as
English	A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima	scientific article; zbMATH DE number 7319278

Statements

instance of

scholarly article

0 references

title

A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (English)

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

10 March 2021

0 references

full work available at URL

https://arxiv.org/abs/1905.11904

0 references

zbMATH Keywords

nonsmooth nonconvex optimization

0 references

Bregman-Moreau and Bregman forward-backward envelopes

0 references

relative smoothness

0 references

KL inequality

0 references

nonlinear error bound

0 references

nonisolated local minima

0 references

superlinear convergence

0 references

describes a project that uses

SuperMann

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Optimal subgradient methods: computational properties for large-scale linear inverse problems

0 references

Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity

0 references

Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity

0 references

Finding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methods

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

Nonlinear error bounds via a change of function

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

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

0 references

Q3412058

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Regularizing with Bregman--Moreau Envelopes

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

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

0 references

Clarke Subgradients of Stratifiable Functions

0 references

Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity

0 references

From error bounds to the complexity of first-order descent methods for convex functions

0 references

Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs

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

Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization

0 references

An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems

0 references

An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions

0 references

A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems

0 references

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

0 references

Quasi-Newton Methods, Motivation and Theory

0 references

Generalizations of the Dennis--Moré Theorem

0 references

Finite-Dimensional Variational Inequalities and Complementarity Problems

0 references

Local behavior of an iterative framework for generalized equations with nonisolated solutions

0 references

A generalized proximal point algorithm for certain non-convex minimization problems

0 references

A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization

0 references

Newton-Type Methods for Optimization and Variational Problems

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 proximal mappings and Bregman-Moreau envelopes under relative prox-regularity

0 references

First-order methods almost always avoid strict saddle points

0 references

Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries

0 references

Regularized Newton methods for convex minimization problems with singular solutions

0 references

Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems

0 references

A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems

0 references

Further properties of the forward-backward envelope with applications to difference-of-convex programming

0 references

An envelope for Davis-Yin splitting and strict saddle-point avoidance

0 references

Q5643297

0 references

On semi- and subanalytic geometry

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

Properties of the Moreau-Yosida regularization of a piecewise \(C^2\) convex function

0 references

Proximité et dualité dans un espace hilbertien

0 references

Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization

0 references

Gradient methods for minimizing composite functions

0 references

Implementable tensor methods in unconstrained convex optimization

0 references

Q5491447

0 references

Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality

0 references

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

0 references

Behavior of accelerated gradient methods near critical points of nonconvex functions

0 references

Q4257431

0 references

Generalized Hessian Properties of Regularized Nonsmooth Functions

0 references

Prox-regular functions in variational analysis

0 references

Convex Analysis

0 references

Variational Analysis

0 references

Forward-backward quasi-Newton methods for nonsmooth optimization problems

0 references

A geometric analysis of phase retrieval

0 references

Low rank matrix completion by alternating steepest descent methods

0 references

Entropic Proximal Mappings with Applications to Nonlinear Programming

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

A coordinate gradient descent method for nonsmooth separable minimization

0 references

A regularized Newton method without line search for unconstrained optimization

0 references

Q4392286

0 references

Geometric categories and o-minimal structures

0 references

Forward-backward splitting with Bregman distances

0 references

Q2765625

0 references

On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition

0 references

Identifiers

zbMATH Open document ID

1461.90105

0 references

DOI

10.1137/19M1264783

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5853567

Revision as of 17:40, 24 July 2024 ReferenceBot (talk \| contribs) Bots 1,895,659 edits ‎Changed an Item ← Older edit	Latest revision as of 09:26, 30 July 2024 Openalex240730090724 (talk \| contribs) 579,206 edits Set OpenAlex properties.
	Property / OpenAlex ID
		W3021534257
	Property / OpenAlex ID: W3021534257 / rank
		Normal rank