On gradients of functions definable in o-minimal structures

DOI10.5802/AIF.1638zbMath0934.32009OpenAlexW2022541060MaRDI QIDQ1266237

Publication date: 14 September 1998

Published in: Annales de l'Institut Fourier (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=AIF_1998__48_3_769_0

zbMATH Keywords

subanalytic sets \(o\)-minimal structure flows of gradient Łojasiewicz inequalities trajectories of gradient

Mathematics Subject Classification ID

Model theory (03C99) Real-analytic and semi-analytic sets (14P15) (C^infty)-functions, quasi-analytic functions (26E10) Semi-analytic sets, subanalytic sets, and generalizations (32B20) Real-analytic functions (26E05) Analytic algebras and generalizations, preparation theorems (32B05)

Related Items (only showing first 100 items - show all)

CUSTOM: a calibration region recovery approach for highly subsampled dynamic parallel magnetic resonance imaging ⋮ Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds ⋮ Alternating DC algorithm for partial DC programming problems ⋮ Łojasiewicz inequalities in o-minimal structures ⋮ Forward-backward quasi-Newton methods for nonsmooth optimization 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 ⋮ 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 ⋮ Łojasiewicz exponents of certain analytic functions ⋮ Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems ⋮ A convergent least-squares regularized blind deconvolution approach ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems ⋮ On the topology of the Milnor-Lê fibration for functions of three real variables ⋮ Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints ⋮ Global convergence of model function based Bregman proximal minimization algorithms ⋮ A simplified view of first order methods for 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 ⋮ An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ Non-convex split Feasibility problems: models, algorithms and theory ⋮ Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method ⋮ On the rotational invariant \(L_1\)-norm PCA ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ Global convergence of proximal iteratively reweighted algorithm ⋮ Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem ⋮ Set regularities and feasibility problems ⋮ A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem ⋮ General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems ⋮ Proximal alternating linearized minimization for nonconvex and nonsmooth problems ⋮ Convergence of ADMM for multi-block nonconvex separable optimization models ⋮ Transversality and alternating projections for nonconvex sets ⋮ On the Łojasiewicz-Simon gradient inequality on submanifolds ⋮ Rate of convergence to equilibrium and Łojasiewicz-type estimates ⋮ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods ⋮ Sur la topologie des fibres d'une fonction définissable dans une structure o-minimale. (On the topology of fibers of functions definable in an o-minimal structure) ⋮ 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 ⋮ Asymptotic bias of stochastic gradient search ⋮ 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 ⋮ Proximal point method on Finslerian manifolds and the ``effort-accuracy trade-off ⋮ The divergence of the BFGS and Gauss Newton methods ⋮ Robust principal component analysis using facial reduction ⋮ Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria ⋮ An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems ⋮ Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis ⋮ Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes ⋮ A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality ⋮ Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization ⋮ Local linear convergence of an ADMM-type splitting framework for equality constrained optimization ⋮ 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 ⋮ Nonlinear error bounds via a change of function ⋮ A projection method on measures sets ⋮ Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems ⋮ On the convergence of the proximal algorithm for nonsmooth functions involving analytic features ⋮ Tame functions are semismooth ⋮ Stability of saddle points via explicit coderivatives of pointwise subdifferentials ⋮ A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization ⋮ Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema ⋮ On the robust PCA and Weiszfeld's algorithm ⋮ Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems ⋮ Asymptotic behaviour of self-contracted planar curves and gradient orbits of convex functions ⋮ Computing Riemannian center of mass on Hadamard manifolds ⋮ Alternating direction method of multipliers with difference of convex functions ⋮ Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm ⋮ Dual descent methods as tension reduction systems ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) ⋮ Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning ⋮ Robust Schatten-\(p\) norm based approach for tensor completion ⋮ Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization ⋮ A proximal point-type method for multicriteria optimization ⋮ Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems ⋮ A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization ⋮ Multiplicative noise removal via using nonconvex regularizers based on total variation and wavelet frame ⋮ Semi-algebraic neighborhoods of closed semi-algebraic sets ⋮ On DC based methods for phase retrieval ⋮ Using Landweber iteration to quantify source conditions -- a numerical study ⋮ The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms ⋮ Horizontal gradient of polynomials ⋮ Distributed block-diagonal approximation methods for regularized empirical risk minimization ⋮ A general double-proximal gradient algorithm for d.c. programming ⋮ On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint ⋮ A control-theoretic perspective on optimal high-order optimization ⋮ Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition ⋮ Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems ⋮ Convergence to equilibrium for time and space discretizations of the Cahn-Hilliard equation ⋮ Proximal gradient method for huberized support vector machine ⋮ Rectifiability of self-contracted curves in the Euclidean space and applications ⋮ Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates ⋮ On damped second-order gradient systems ⋮ Quadratic cohomology

Cites Work

This page was built for publication: On gradients of functions definable in o-minimal structures