Clarke Subgradients of Stratifiable Functions
DOI10.1137/060670080zbMATH Open1142.49006arXivmath/0601530OpenAlexW2022164193MaRDI QIDQ3503208FDOQ3503208
Jérôme Bolte, A. S. Lewis, Masahiro Shiota, A. Daniilidis
Publication date: 22 May 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0601530
Nonsmooth analysis (49J52) Inequalities involving derivatives and differential and integral operators (26D10) Variational inequalities (49J40) Semi-analytic sets, subanalytic sets, and generalizations (32B20)
Cited In (only showing first 100 items - show all)
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- Non-Lipschitz Models for Image Restoration with Impulse Noise Removal
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
- Distributed stochastic nonsmooth nonconvex optimization
- Avoiding bad steps in Frank-Wolfe variants
- Inertial alternating generalized forward-backward splitting for image colorization
- On definable multifunctions and Łojasiewicz inequalities
- PET-MRI joint reconstruction with common edge weighted total variation regularization
- Proximal Gradient Methods for Machine Learning and Imaging
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
- An ADMM-based SQP method for separably smooth nonconvex optimization
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- Kurdyka-Łojasiewicz exponent via inf-projection
- Using Landweber iteration to quantify source conditions -- a numerical study
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
- Subgradient Sampling for Nonsmooth Nonconvex Minimization
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
- Proximal methods avoid active strict saddles of weakly convex functions
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- A proximal DC approach for quadratic assignment problem
- Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- The Structure of Conservative Gradient Fields
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Maximum time step for the BDF3 scheme applied to gradient flows
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
- Stochastic subgradient method converges on tame functions
- An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- The Łojasiewicz exponent of a continuous subanalytic function at an isolated zero
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- Incremental without replacement sampling in nonconvex optimization
- Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity
- MAP inference via \(\ell_2\)-sphere linear program reformulation
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
- Global convergence of proximal iteratively reweighted algorithm
- A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization
- An Inertial Newton Algorithm for Deep Learning
- The value function approach to convergence analysis in composite optimization
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- Nonconvex-TV Based Image Restoration with Impulse Noise Removal
- Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations
- On damped second-order gradient systems
- Alternating DC algorithm for partial DC programming problems
- Corrigendum to “The Łojasiewicz exponent of a continuous subanalytic function at an isolated zero”
- New convergence results for the inexact variable metric forward-backward method
- Computing Riemannian center of mass on Hadamard manifolds
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
- A survey on some recent developments of alternating direction method of multipliers
- A forward-backward algorithm with different inertial terms for structured non-convex minimization problems
- Convergence of constant step stochastic gradient descent for non-smooth non-convex functions
- A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal
- Tensor train rank minimization with hybrid smoothness regularization for visual data recovery
- Bregman proximal gradient algorithms for deep matrix factorization
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- On the first integral conjecture of René Thom
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- Riemannian proximal gradient methods
- On Algorithms for Difference of Monotone Operators
- On Algorithms for Difference of Monotone Operators
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Qualification Conditions in Semialgebraic Programming
- A second-order dynamical approach with variable damping to nonconvex smooth minimization
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging
- From error bounds to the complexity of first-order descent methods for convex functions
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Title not available (Why is that?)
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Extragradient method in optimization: convergence and complexity
- A proximal point-type method for multicriteria optimization
- Dual descent methods as tension reduction systems
- A block coordinate variable metric forward-backward algorithm
- Łojasiewicz inequalities in o-minimal structures
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A family of functional inequalities: Łojasiewicz inequalities and displacement convex functions
- Proximal point algorithm for differentiable quasi-convex multiobjective optimization
- Critical values of set-valued maps with stratifiable graphs. Extensions of Sard and Smale-Sard theorems
This page was built for publication: Clarke Subgradients of Stratifiable Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503208)