The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
From MaRDI portal
Publication:5426904
DOI10.1137/050644641zbMath1129.26012OpenAlexW2021361347MaRDI QIDQ5426904
Jérôme Bolte, Adrian S. Lewis, Aris Daniilidis
Publication date: 16 November 2007
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050644641
nonsmooth analysisdynamical systemsubdifferentialdescent methodLojasiewicz inequalitysubanalytic function
Nonsmooth analysis (49J52) Real-analytic and semi-analytic sets (14P15) Gradient-like behavior; isolated (locally maximal) invariant sets; attractors, repellers for topological dynamical systems (37B35) Inequalities involving derivatives and differential and integral operators (26D10) Semi-analytic sets, subanalytic sets, and generalizations (32B20)
Related Items (only showing first 100 items - show all)
Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization ⋮ Convergence guarantees for a class of non-convex and non-smooth optimization problems ⋮ A Spatial Color Compensation Model Using Saturation-Value Total Variation ⋮ Flexible parameter selection methods for Rician noise removal with convergence guarantee ⋮ Stability of periodic solutions for Lipschitz systems obtained via the averaging method ⋮ Łojasiewicz inequality and exponential convergence of the full‐range model of CNNs ⋮ A combined dictionary learning and TV model for image restoration with convergence analysis ⋮ Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds ⋮ Minimization of $L_1$ Over $L_2$ for Sparse Signal Recovery with Convergence Guarantee ⋮ Minimizing L 1 over L 2 norms on the gradient ⋮ A Splitting Scheme for Flip-Free Distortion Energies ⋮ On an iteratively reweighted linesearch based algorithm for nonconvex composite optimization ⋮ New Bregman proximal type algoritms for solving DC optimization problems ⋮ An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Robust sensing of low-rank matrices with non-orthogonal sparse decomposition ⋮ A tensor optimization algorithm for computing Lagrangians of hypergraphs ⋮ Global convergence of the gradient method for functions definable in o-minimal structures ⋮ Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications ⋮ Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems ⋮ Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions ⋮ The convergence properties of infeasible inexact proximal alternating linearized minimization ⋮ Affine Invariant Convergence Rates of the Conditional Gradient Method ⋮ Study on \(L_1\) over \(L_2\) Minimization for nonnegative signal recovery ⋮ Joint Reconstruction-Segmentation on Graphs ⋮ Trimmed Statistical Estimation via Variance Reduction ⋮ Novel Proximal Gradient Methods for Nonnegative Matrix Factorization with Sparsity Constraints ⋮ The Frank-Wolfe algorithm: a short introduction ⋮ Radial duality. II: Applications and algorithms ⋮ Stability in a Hebbian Network of Kuramoto Oscillators with Second-Order Couplings for Binary Pattern Retrieve ⋮ An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise ⋮ An inertial alternating minimization with Bregman distance for a class of nonconvex and nonsmooth problems ⋮ Additive Schwarz Methods for Convex Optimization as Gradient Methods ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ Image cartoon-texture decomposition by a generalized non-convex low-rank minimization method ⋮ Quaternion-based color image completion via logarithmic approximation ⋮ A refined inertial DC algorithm for DC programming ⋮ An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization ⋮ Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality ⋮ Inducing sparsity via the horseshoe prior in imaging problems ⋮ A forward-backward algorithm with different inertial terms for structured non-convex minimization problems ⋮ Saturation-value based higher-order regularization for color image restoration ⋮ Calculus rules of the generalized concave Kurdyka-Łojasiewicz property ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ Random Coordinate Descent Methods for Nonseparable Composite Optimization ⋮ Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems ⋮ On optimal universal first-order methods for minimizing heterogeneous sums ⋮ Convergence Analysis for Bregman Iterations in Minimizing a Class of Landau Free Energy Functionals ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope ⋮ Alternating Proximal Regularized Dictionary Learning ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An introduction to continuous optimization for imaging ⋮ On the Łojasiewicz exponent of Kuramoto model ⋮ Proximal Distance Algorithms: Theory and Examples ⋮ Sharpness, Restart, and Acceleration ⋮ A second-order dynamical approach with variable damping to nonconvex smooth minimization ⋮ On phase retrieval via matrix completion and the estimation of low rank PSD matrices ⋮ Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization ⋮ Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ Composite Optimization by Nonconvex Majorization-Minimization ⋮ Modern regularization methods for inverse problems ⋮ A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems ⋮ Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems ⋮ An Inertial Newton Algorithm for Deep Learning ⋮ Kurdyka–Łojasiewicz–Simon inequality for gradient flows in metric spaces ⋮ Non-Lipschitz Models for Image Restoration with Impulse Noise Removal ⋮ Accelerate stochastic subgradient method by leveraging local growth condition ⋮ A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization ⋮ Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging ⋮ A Three-Operator Splitting Algorithm for Nonconvex Sparsity Regularization ⋮ A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima ⋮ Nonlocal robust tensor recovery with nonconvex regularization * ⋮ Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems ⋮ Triple Decomposition and Tensor Recovery of Third Order Tensors ⋮ Limited-Angle CT Reconstruction via the $L_1/L_2$ Minimization ⋮ An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model * ⋮ Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity ⋮ The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property ⋮ A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization ⋮ A penalty PALM method for sparse portfolio selection problems ⋮ Proximal Gradient Methods for Machine Learning and Imaging ⋮ Forward-backward quasi-Newton methods for nonsmooth optimization problems ⋮ Further properties of the forward-backward envelope with applications to difference-of-convex programming ⋮ The Kurdyka–Łojasiewicz–Simon inequality and stabilisation in nonsmooth infinite-dimensional gradient systems ⋮ Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems ⋮ Global Convergence of Splitting Methods for Nonconvex Composite Optimization ⋮ A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function ⋮ A Sard theorem for tame set-valued mappings ⋮ Sweeping by a tame process ⋮ Composite Difference-Max Programs for Modern Statistical Estimation Problems ⋮ Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ Non-convex split Feasibility problems: models, algorithms and theory ⋮ Computing extreme eigenvalues of large scale Hankel tensors ⋮ Convergence of linear Bregman ADMM for nonconvex and nonsmooth problems with nonseparable structure ⋮ PET-MRI joint reconstruction with common edge weighted total variation regularization
This page was built for publication: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
