The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

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

zbMATH Keywords

nonsmooth analysisdynamical systemsubdifferentialdescent methodLojasiewicz inequalitysubanalytic function

Mathematics Subject Classification ID

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

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 ₁ over L ₂ 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 ⋮ Qualification Conditions in Semialgebraic Programming ⋮ Robust low transformed multi-rank tensor methods for image alignment ⋮ Hölder-type global error bounds for non-degenerate polynomial systems ⋮ New convergence results for the inexact variable metric forward-backward method ⋮ A forward-backward dynamical approach for nonsmooth problems with block structure coupled by a smooth function ⋮ Singular vanishing-viscosity limits of gradient flows: the finite-dimensional case ⋮ Attitude synchronization and rigid formation of multiple rigid bodies over proximity networks ⋮ First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems ⋮ Image completion and blind deconvolution: model and algorithm ⋮ Separating variables to accelerate non-convex regularized optimization ⋮ A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem ⋮ Set regularities and feasibility problems ⋮ Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates ⋮ The equivalence of three types of error bounds for weakly and approximately convex functions ⋮ Forward-Backward Envelope for the Sum of Two Nonconvex Functions: Further Properties and Nonmonotone Linesearch Algorithms ⋮ Fast gradient methods for uniformly convex and weakly smooth problems ⋮ Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection ⋮ Iteratively reweighted \(\ell _1\) algorithms with extrapolation ⋮ Non-smooth non-convex Bregman minimization: unification and new algorithms ⋮ Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality ⋮ The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning ⋮ 3D fluid flow estimation with integrated particle reconstruction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 ⋮ Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ On the uniqueness of Schwarzschild-de Sitter spacetime ⋮ A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection ⋮ Activity Identification and Local Linear Convergence of Forward--Backward-type Methods ⋮ Tensor factorization with total variation and Tikhonov regularization for low-rank tensor completion in imaging data ⋮ A proximal interior point algorithm with applications to image processing ⋮ An eikonal equation with vanishing Lagrangian arising in global optimization ⋮ A simple nearly optimal restart scheme for speeding up first-order methods ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ General Hölder smooth convergence rates follow from specialized rates assuming growth bounds ⋮ Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity ⋮ Sparse estimation: an MMSE approach ⋮ Convergence analysis of a proximal point algorithm for minimizing differences of functions ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems ⋮ The Kurdyka–Łojasiewicz Inequality as Regularity Condition ⋮ Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property ⋮ Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies ⋮ Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization ⋮ Łojasiewicz inequality at singular points ⋮ A LogTVSCAD nonconvex regularization model for image deblurring in the presence of impulse noise ⋮ A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization ⋮ Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality ⋮ Global Łojasiewicz-type inequality for non-degenerate polynomial maps ⋮ A nonsmooth Morse--Sard theorem for subanalytic 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 ⋮ Computing Riemannian center of mass on Hadamard manifolds ⋮ Multiscale analysis of singularly perturbed finite dimensional gradient flows: the minimizing movement approach ⋮ On the convergence of higher-order orthogonal iteration ⋮ A neurodynamic approach to convex optimization problems with general constraint ⋮ Inexact Half-Quadratic Optimization for Linear Inverse Problems ⋮ On Collaborative Compressive Sensing Systems: The Framework, Design, and Algorithm ⋮ Łojasiewicz-type inequalities with explicit exponents for the largest eigenvalue function of real symmetric polynomial matrices ⋮ Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs ⋮ Hölder-Like Property and Metric Regularity of a Positive-Order for Implicit Multifunctions ⋮ Multiplicative noise removal via using nonconvex regularizers based on total variation and wavelet frame ⋮ Optimality conditions and global convergence for nonlinear semidefinite programming ⋮ Faster subgradient methods for functions with Hölderian growth ⋮ An augmented Lagrangian proximal alternating method for sparse discrete optimization problems ⋮ The Łojasiewicz exponent of a continuous subanalytic function at an isolated zero ⋮ 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 ``nonconvex+nonconvex approach for image restoration with impulse noise removal ⋮ Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints ⋮ A single image dehazing model using total variation and inter-channel correlation ⋮ Sequence Convergence of Inexact Nonconvex and Nonsmooth Algorithms with More Realistic Assumptions ⋮ Using Landweber iteration to quantify source conditions -- a numerical study ⋮ Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph ⋮ Variable Metric Forward-Backward Algorithm for Composite Minimization Problems ⋮ On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity ⋮ Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization ⋮ Proximal gradient method for huberized support vector machine ⋮ Nonconvex-TV Based Image Restoration with Impulse Noise Removal ⋮ Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates ⋮ Alternating proximal gradient method for sparse nonnegative Tucker decomposition ⋮ Additive Schwarz methods for convex optimization with backtracking ⋮ Alternating DC algorithm for partial DC programming problems ⋮ Łojasiewicz inequalities in o-minimal structures ⋮ An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems ⋮ A new approach to the proximal point method: convergence on general Riemannian manifolds ⋮ Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ On local convergence of the method of alternating projections ⋮ 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 seminorm regularized alternating least squares algorithm for canonical tensor decomposition ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Convergence of proximal splitting algorithms in \(\operatorname{CAT}(\kappa)\) spaces and beyond ⋮ A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints ⋮ 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 ⋮ A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms ⋮ Restricted limiting subdifferential and applications ⋮ Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints ⋮ Riemannian proximal gradient methods ⋮ A fast patch-dictionary method for whole image recovery ⋮ Global convergence of model function based Bregman proximal minimization algorithms ⋮ A simplified view of first order methods for optimization ⋮ Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms ⋮ The developments of proximal point algorithms ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ Global convergence of proximal iteratively reweighted algorithm ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application ⋮ A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem ⋮ Peaceman-Rachford splitting for a class of nonconvex optimization problems ⋮ Proximal alternating linearized minimization for nonconvex and nonsmooth problems ⋮ Convergence of ADMM for multi-block nonconvex separable optimization models ⋮ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods ⋮ A fresh variational-analysis look at the positive semidefinite matrices world ⋮ Extragradient method in optimization: convergence and complexity ⋮ The value function approach to convergence analysis in composite optimization ⋮ Formation, stability and basin of phase-locking for Kuramoto oscillators bidirectionally coupled in a ring ⋮ An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration ⋮ Proximal point method on Finslerian manifolds and the ``effort-accuracy trade-off ⋮ Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function ⋮ Convergence of analytic gradient-type systems with periodicity and its applications in Kuramoto models ⋮ Arc-length-based Lyapunov tests for convergence and stability with applications to systems having a continuum of equilibria ⋮ Convergence analysis of difference-of-convex algorithm with subanalytic data ⋮ Greedy algorithms for high-dimensional eigenvalue problems ⋮ Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis ⋮ Nonconvex TGV regularization model for multiplicative noise removal with spatially varying parameters ⋮ Global convergence of ADMM in nonconvex nonsmooth optimization ⋮ A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality ⋮ A new alternating direction method for linearly constrained nonconvex optimization problems ⋮ Cauchy noise removal by nonconvex ADMM with convergence guarantees ⋮ An inexact PAM method for computing Wasserstein barycenter with unknown supports ⋮ A proximal difference-of-convex algorithm with extrapolation ⋮ A cubic spline penalty for sparse approximation under tight frame balanced model ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ On definable multifunctions and Łojasiewicz inequalities ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ Accelerating the DC algorithm for smooth functions ⋮ Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems ⋮ On the proximal gradient algorithm with alternated inertia ⋮ On the convergence of the proximal algorithm for nonsmooth functions involving analytic features ⋮ Tame functions are semismooth ⋮ Inertial alternating generalized forward-backward splitting for image colorization ⋮ A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization ⋮ On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems ⋮ Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema ⋮ Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions ⋮ On the interplay between acceleration and identification for the proximal gradient algorithm ⋮ Asymptotic behaviour of self-contracted planar curves and gradient orbits of 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 ⋮ Alternating direction method of multipliers with difference of convex functions ⋮ Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm ⋮ Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach ⋮ Quartic first-order methods for low-rank minimization ⋮ Dual descent methods as tension reduction systems ⋮ A block coordinate variable metric forward-backward algorithm ⋮ 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 ⋮ On sublevel set estimates and the Laplacian ⋮ 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 ⋮ A Barzilai-Borwein gradient algorithm for spatio-temporal Internet traffic data completion via tensor triple decomposition ⋮ New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors ⋮ MAP inference via \(\ell_2\)-sphere linear program reformulation ⋮ An ADMM-based SQP method for separably smooth nonconvex optimization ⋮ Alternating projections with applications to Gerchberg-Saxton error reduction ⋮ On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization ⋮ A subgradient-based continuous-time algorithm for constrained distributed quadratic programming ⋮ The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms ⋮ Convergence analysis for gradient flows in the training of artificial neural networks with ReLU activation ⋮ The Łojasiewicz inequality for free energy functionals on a graph ⋮ On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint ⋮ 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 ⋮ Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems ⋮ Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis ⋮ Restarting Frank-Wolfe: faster rates under Hölderian error bounds