Clarke Subgradients of Stratifiable Functions
From MaRDI portal
Abstract: We establish the following result: if the graph of a (nonsmooth) real-extended-valued function is closed and admits a Whitney stratification, then the norm of the gradient of at relative to the stratum containing bounds from below all norms of Clarke subgradients of at . As a consequence, we obtain some Morse-Sard type theorems as well as a nonsmooth Kurdyka-L ojasiewicz inequality for functions definable in an arbitrary o-minimal structure.
Recommendations
- Clarke subgradients for directionally Lipschitzian stratifiable functions
- A nonsmooth Morse--Sard theorem for subanalytic functions
- Clarke critical values of subanalytic Lipschitz continuous functions
- Singular points of order k of Clarke regular and arbitrary functions.
- Nonsmooth Calculus in Finite Dimensions
Cited in
(only showing first 100 items - show all)- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- 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
- From error bounds to the complexity of first-order descent methods for convex functions
- Global convergence of proximal iteratively reweighted algorithm
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Convergence of ADMM for multi-block nonconvex separable optimization models
- Extragradient method in optimization: convergence and complexity
- The value function approach to convergence analysis in composite optimization
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- On definable multifunctions and Łojasiewicz inequalities
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems
- Inertial alternating generalized forward-backward splitting for image colorization
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization
- 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
- Maximum time step for the BDF3 scheme applied to gradient flows
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Incremental without replacement sampling in nonconvex optimization
- MAP inference via _2-sphere linear program reformulation
- An ADMM-based SQP method for separably smooth nonconvex optimization
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- Distributed stochastic nonsmooth nonconvex optimization
- Multi-dimensional image recovery via fully-connected tensor network decomposition under the learnable transforms
- Avoiding bad steps in Frank-Wolfe variants
- Alternating DC algorithm for partial DC programming problems
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- A survey on some recent developments of alternating direction method of multipliers
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
- Proximal methods avoid active strict saddles of weakly convex functions
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- Tensor completion via fully-connected tensor network decomposition with regularized factors
- Riemannian proximal gradient methods
- Global convergence of model function based Bregman proximal minimization algorithms
- Convergence of constant step stochastic gradient descent for non-smooth non-convex functions
- Kurdyka-Łojasiewicz exponent via inf-projection
- A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem
- 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
- Convergence of a stochastic subgradient method with averaging for nonsmooth nonconvex constrained optimization
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- Computing Riemannian center of mass on Hadamard manifolds
- Stochastic subgradient method converges on tame functions
- Multiplicative noise removal via using nonconvex regularizers based on total variation and wavelet frame
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- A new proximal iterative hard thresholding method with extrapolation for \(\ell _0\) minimization
- Using Landweber iteration to quantify source conditions -- a numerical study
- Optimal multivariate Gaussian fitting with applications to PSF modeling in two-photon microscopy imaging
- Convergence analysis for iterative data-driven tight frame construction scheme
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- On damped second-order gradient systems
- Non-smooth non-convex Bregman minimization: unification and new algorithms
- Every ordinary differential equation with a strict Lyapunov function is a gradient system
- A nonsmooth Morse--Sard theorem for subanalytic functions
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Sard theorems for Lipschitz functions and applications in optimization
- New convergence results for the inexact variable metric forward-backward method
- Image completion and blind deconvolution: model and algorithm
- Conservative and semismooth derivatives are equivalent for semialgebraic maps
- The equivalence of three types of error bounds for weakly and approximately convex functions
- An inexact scalarization proximal point method for multiobjective quasiconvex minimization
- Stochastic proximal subgradient descent oscillates in the vicinity of its accumulation set
- Convergence rates of the heavy-ball method under the Łojasiewicz property
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
- An abstract convergence framework with application to inertial inexact forward-backward methods
- Nonconvex model for mixing noise with fractional-order regularization
- Łojasiewicz inequalities in o-minimal structures
- Generic minimizing behavior in semialgebraic optimization
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- The Łojasiewicz exponent of a continuous subanalytic function at an isolated zero
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- Nonconvex-TV based image restoration with impulse noise removal
- A proximal algorithm with quasi distance. Application to habit's formation
- An inexact proximal method for quasiconvex minimization
- Local minimizers of semi-algebraic functions from the viewpoint of tangencies
- Global convergence of splitting methods for nonconvex composite optimization
- Critical values of set-valued maps with stratifiable graphs. Extensions of Sard and Smale-Sard theorems
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Semi-algebraic functions have small subdifferentials
- The Morse-Sard theorem for Clarke critical values
- Proximal alternating linearized minimization 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
- Sweeping by a tame process
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
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)
