Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355)

!

WARNING

This is the item page for this Wikibase entity, intended for internal use and editing purposes.

Please use the normal view instead:

Local convergence of the heavy-ball method and iPiano for non-convex optimization

scientific article; zbMATH DE number 6882325

Language	Label	Description	Also known as
default for all languages	No label defined
English	Local convergence of the heavy-ball method and iPiano for non-convex optimization	scientific article; zbMATH DE number 6882325

Statements

instance of

scholarly article

0 references

title

Local convergence of the heavy-ball method and iPiano for non-convex optimization (English)

0 references

author

Peter Ochs

0 references

published in

Journal of Optimization Theory and Applications

0 references

publication date

8 June 2018

0 references

full work available at URL

https://arxiv.org/abs/1606.09070

0 references

zbMATH Keywords

inertial forward-backward splitting

0 references

non-convex optimization

0 references

describes a project that uses

iPiano

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Some methods of speeding up the convergence of iteration methods

0 references

Heavy-ball method in nonconvex optimization problems

0 references

iPiano: inertial proximal algorithm for nonconvex optimization

0 references

Local differentiability of distance functions

0 references

Prox-regular functions in variational analysis

0 references

Integration of subdifferentials of nonconvex functions

0 references

Variational Analysis

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 gradients of functions definable in o-minimal structures

0 references

Q5643297

0 references

On semi- and subanalytic geometry

0 references

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

0 references

Clarke Subgradients of Stratifiable Functions

0 references

Q4210476

0 references

A nonsmooth Morse--Sard theorem for subanalytic functions

0 references

Q4392286

0 references

Convergence of the Iterates of Descent Methods for Analytic Cost Functions

0 references

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

0 references

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

0 references

A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality

0 references

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

0 references

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

0 references

Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function

0 references

On the convergence of a linesearch based proximal-gradient method for nonconvex optimization

0 references

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

0 references

A block coordinate variable metric forward-backward algorithm

0 references

Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates

0 references

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

0 references

Proximal alternating linearized minimization for nonconvex and nonsmooth problems

0 references

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

0 references

Forward-backward quasi-Newton methods for nonsmooth optimization problems

0 references

Global convergence of splitting methods for nonconvex composite optimization

0 references

Peaceman-Rachford splitting for a class of nonconvex optimization problems

0 references

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

0 references

On iteratively reweighted algorithms for nonsmooth nonconvex optimization in computer vision

0 references

Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs

0 references

Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods

0 references

Convergence to equilibrium for the backward Euler scheme and applications

0 references

A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion

0 references

Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems

0 references

Prox-regularity of spectral functions and spectral sets

0 references

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

0 references

New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors

0 references

Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Local linear convergence for alternating and averaged nonconvex projections

0 references

Differential properties of the Moreau envelope

0 references

Alternating Projections on Manifolds

0 references

Identifiers

zbMATH Open document ID

1404.90105

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

10.1007/S10957-018-1272-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Local convergence of the heavy-ball method and iPiano for non-convex optimization