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

DOI10.1090/S0002-9947-09-05048-XzbMath1202.26026arXiv0802.0826OpenAlexW2068357778MaRDI QIDQ3566718

Jérôme Bolte, Olivier Ley, Aris Daniilidis, Laurent Mazet

Publication date: 8 June 2010

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0802.0826

zbMATH Keywords

global convergence convex functions Łojasiewicz inequality gradient method metric regularity proximal method talweg gradient inequalities subgradient curve

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Dynamical systems in optimization and economics (37N40) Inequalities involving derivatives and differential and integral operators (26D10) Model theory of ordered structures; o-minimality (03C64)

Related Items (only showing first 100 items - show all)

Convergence rate analysis for the higher order power method in best rank one approximations of tensors ⋮ An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems ⋮ Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition ⋮ A new approach to the proximal point method: convergence on general Riemannian manifolds ⋮ Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ Quantitative analysis of a subgradient-type method for equilibrium problems ⋮ An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions ⋮ A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Convergence of proximal splitting algorithms in \(\operatorname{CAT}(\kappa)\) spaces and beyond ⋮ Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ The Kurdyka–Łojasiewicz–Simon inequality and stabilisation in nonsmooth infinite-dimensional gradient systems ⋮ Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems ⋮ A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function ⋮ Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity ⋮ A simplified view of first order methods for optimization ⋮ Separation of real algebraic sets and the Łojasiewicz exponent ⋮ Sweeping by a tame process ⋮ A family of functional inequalities: Łojasiewicz inequalities and displacement convex functions ⋮ Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms ⋮ Stochastic Methods for Composite and Weakly Convex Optimization Problems ⋮ An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems ⋮ Non-convex split Feasibility problems: models, algorithms and theory ⋮ Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure ⋮ Accelerated Methods for NonConvex Optimization ⋮ New convergence results for the inexact variable metric forward-backward method ⋮ First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem ⋮ Set regularities and feasibility problems ⋮ A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem ⋮ Proximal alternating linearized minimization for nonconvex and nonsmooth problems ⋮ Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality ⋮ Optimal non-asymptotic analysis of the Ruppert-Polyak averaging stochastic algorithm ⋮ Rate of convergence to equilibrium and Łojasiewicz-type estimates ⋮ First-order methods almost always avoid strict saddle points ⋮ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ Every ordinary differential equation with a strict Lyapunov function is a gradient system ⋮ Hölder metric regularity of set-valued maps ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ On the uniqueness of Schwarzschild-de Sitter spacetime ⋮ Shape turnpike for linear parabolic PDE models ⋮ Polyak-Łojasiewicz inequality on the space of measures and convergence of mean-field birth-death processes ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ Extragradient method in optimization: convergence and complexity ⋮ Learning in games with continuous action sets and unknown payoff functions ⋮ Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function ⋮ Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ The Kurdyka–Łojasiewicz Inequality as Regularity Condition ⋮ Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis ⋮ Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property ⋮ Bounding regions to plane steepest descent curves of quasiconvex families ⋮ A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality ⋮ Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization ⋮ On definable multifunctions and Łojasiewicz inequalities ⋮ Nonlinear error bounds via a change of function ⋮ Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems ⋮ Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality ⋮ Stability of saddle points via explicit coderivatives of pointwise subdifferentials ⋮ Rectifiability of non Euclidean planar self-contracted curves ⋮ Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions ⋮ Structured sparsity promoting functions ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ ŁOJASIEWICZ-TYPE INEQUALITIES AND GLOBAL ERROR BOUNDS FOR NONSMOOTH DEFINABLE FUNCTIONS IN O-MINIMAL STRUCTURES ⋮ Asymptotic behaviour of self-contracted planar curves and gradient orbits of convex functions ⋮ Kurdyka-Łojasiewicz property of zero-norm composite functions ⋮ Dual descent methods as tension reduction systems ⋮ A block coordinate variable metric forward-backward algorithm ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) ⋮ Maximum time step for the BDF3 scheme applied to gradient flows ⋮ Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models ⋮ Gradient stability of high-order BDF methods and some applications ⋮ Hölder-Like Property and Metric Regularity of a Positive-Order for Implicit Multifunctions ⋮ Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization ⋮ Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method ⋮ A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization ⋮ Necessary conditions for linear convergence of iterated expansive, set-valued mappings ⋮ An augmented Lagrangian proximal alternating method for sparse discrete optimization problems ⋮ An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems ⋮ Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity ⋮ A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization ⋮ On the convergence to equilibria of a sequence defined by an implicit scheme ⋮ Energy stable and convergent finite element schemes for the modified phase field crystal equation ⋮ Using Landweber iteration to quantify source conditions -- a numerical study ⋮ Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods ⋮ Curiosities and counterexamples in smooth convex optimization ⋮ A control-theoretic perspective on optimal high-order optimization ⋮ Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition ⋮ Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization ⋮ Rectifiability of self-contracted curves in the Euclidean space and applications ⋮ Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates ⋮ Avoiding bad steps in Frank-Wolfe variants ⋮ On damped second-order gradient systems ⋮ A proximal algorithm with quasi distance. Application to habit's formation ⋮ Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis

Cites Work

This page was built for publication: Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity