Clarke Subgradients of Stratifiable Functions
From MaRDI portal
Publication:3503208
DOI10.1137/060670080zbMath1142.49006arXivmath/0601530OpenAlexW2022164193MaRDI QIDQ3503208
Jérôme Bolte, Masahiro Shiota, Adrian S. Lewis, Aris 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
Variational inequalities (49J40) Nonsmooth analysis (49J52) 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)
A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods ⋮ Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization ⋮ A Global Convergence Analysis for Computing a Symmetric Low-Rank Orthogonal Approximation ⋮ A Spatial Color Compensation Model Using Saturation-Value Total Variation ⋮ Global Convergence of Splitting Methods for Nonconvex Composite Optimization ⋮ A combined dictionary learning and TV model for image restoration with convergence analysis ⋮ 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 ⋮ Stochastic Methods for Composite and Weakly Convex Optimization Problems ⋮ Data-Driven Tight Frame Construction for Impulsive Noise Removal ⋮ PET-MRI joint reconstruction with common edge weighted total variation regularization ⋮ Qualification Conditions in Semialgebraic Programming ⋮ A New Boosted Proximal Point Algorithm for Minimizing Nonsmooth DC Functions ⋮ Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ A gradient sampling algorithm for stratified maps with applications to topological data analysis ⋮ Global convergence of the gradient method for functions definable in o-minimal structures ⋮ Lyapunov stability of the subgradient method with constant step size ⋮ Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients ⋮ Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions ⋮ Subgradient Sampling for Nonsmooth Nonconvex Minimization ⋮ Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality ⋮ Fully-connected tensor network decomposition for robust tensor completion problem ⋮ Trimmed Statistical Estimation via Variance Reduction ⋮ Certifying the Absence of Spurious Local Minima at Infinity ⋮ FISTA is an automatic geometrically optimized algorithm for strongly convex functions ⋮ An \(l_0\)-norm based color image deblurring model under mixed random-valued impulse and Gaussian noise ⋮ Sufficient Conditions for Instability of the Subgradient Method with Constant Step Size ⋮ Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems ⋮ Proximal algorithm with quasidistances for multiobjective quasiconvex minimization in Riemannian manifolds ⋮ A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems ⋮ Pathological Subgradient Dynamics ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ Efficiency of higher-order algorithms for minimizing composite functions ⋮ Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems ⋮ Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality ⋮ Conservative parametric optimality and the ridge method for tame min-max problems ⋮ A forward-backward algorithm with different inertial terms for structured non-convex minimization problems ⋮ An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems ⋮ Saturation-value based higher-order regularization for color image restoration ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ Critical values of set-valued maps with stratifiable graphs. Extensions of Sard and Smale-Sard theorems ⋮ Convergence analysis of a proximal point algorithm for minimizing differences of functions ⋮ Linear Structure of Functions with Maximal Clarke Subdifferential ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies ⋮ A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal ⋮ Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity ⋮ Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ Generic Minimizing Behavior in Semialgebraic Optimization ⋮ Corrigendum to “The Łojasiewicz exponent of a continuous subanalytic function at an isolated zero” ⋮ Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs ⋮ A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization ⋮ On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods ⋮ A second-order dynamical approach with variable damping to nonconvex smooth minimization ⋮ The Łojasiewicz exponent of a continuous subanalytic function at an isolated zero ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions ⋮ Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints ⋮ Unnamed Item ⋮ Composite Optimization by Nonconvex Majorization-Minimization ⋮ A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems ⋮ Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems ⋮ Sequence Convergence of Inexact Nonconvex and Nonsmooth Algorithms with More Realistic Assumptions ⋮ An Inertial Newton Algorithm for Deep Learning ⋮ Non-Lipschitz Models for Image Restoration with Impulse Noise Removal ⋮ Variable Metric Forward-Backward Algorithm for Composite Minimization Problems ⋮ A Stochastic Subgradient Method for Nonsmooth Nonconvex Multilevel Composition Optimization ⋮ 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 ⋮ The Structure of Conservative Gradient Fields ⋮ Nonconvex-TV Based Image Restoration with Impulse Noise Removal ⋮ Proximal point algorithm for differentiable quasi-convex multiobjective optimization ⋮ An accelerated majorization-minimization algorithm with convergence guarantee for non-Lipschitz wavelet synthesis model * ⋮ Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs ⋮ Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity ⋮ Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming ⋮ The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property ⋮ A proximal algorithm with quasi distance. Application to habit's formation ⋮ Proximal Gradient Methods for Machine Learning and Imaging ⋮ Tensor train rank minimization with hybrid smoothness regularization for visual data recovery ⋮ Alternating DC algorithm for partial DC programming problems ⋮ Łojasiewicz inequalities in o-minimal structures ⋮ Bregman proximal gradient algorithms for deep matrix factorization ⋮ A new approach to the proximal point method: convergence on general Riemannian manifolds ⋮ Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions ⋮ Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Sard theorems for Lipschitz functions and applications in optimization ⋮ Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ Proximal methods avoid active strict saddles of weakly convex functions ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ An inexact proximal method for quasiconvex minimization ⋮ Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
This page was built for publication: Clarke Subgradients of Stratifiable Functions
