Pages that link to "Item:Q1266237"

The following pages link to On gradients of functions definable in o-minimal structures (Q1266237):

Displaying 50 items.

• Łojasiewicz inequalities in o-minimal structures (Q276046) (← links)
• A new approach to the proximal point method: convergence on general Riemannian manifolds (Q283913) (← links)
• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions (Q285919) (← links)
• An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems (Q346822) (← links)
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems (Q403666) (← links)
• Proximal point method on Finslerian manifolds and the ``effort-accuracy'' trade-off (Q463004) (← links)
• The divergence of the BFGS and Gauss Newton methods (Q463731) (← links)
• Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes (Q493265) (← links)
• A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality (Q494873) (← links)
• Nonlinear error bounds via a change of function (Q511953) (← links)
• A projection method on measures sets (Q515908) (← links)
• Stability of saddle points via explicit coderivatives of pointwise subdifferentials (Q526389) (← links)
• Alternating direction method of multipliers with difference of convex functions (Q723734) (← links)
• Dual descent methods as tension reduction systems (Q727232) (← links)
• The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) (Q730526) (← links)
• A proximal point-type method for multicriteria optimization (Q741360) (← links)
• The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
• Distributed block-diagonal approximation methods for regularized empirical risk minimization (Q782443) (← links)
• Continuous dynamics related to monotone inclusions and non-smooth optimization problems (Q829490) (← links)
• Transversality and alternating projections for nonconvex sets (Q895706) (← links)
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features (Q959923) (← links)
• Tame functions are semismooth (Q959961) (← links)
• Asymptotic behaviour of self-contracted planar curves and gradient orbits of convex functions (Q987849) (← links)
• Semi-algebraic neighborhoods of closed semi-algebraic sets (Q1010980) (← links)
• Horizontal gradient of polynomials (Q1041271) (← links)
• 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) (Q1409731) (← links)
• A convergent least-squares regularized blind deconvolution approach (Q1636832) (← links)
• Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• A family of functional inequalities: Łojasiewicz inequalities and displacement convex functions (Q1653290) (← links)
• Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms (Q1653320) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• Global convergence of proximal iteratively reweighted algorithm (Q1675580) (← links)
• Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm (Q1675933) (← links)
• A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
• A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem (Q1685585) (← links)
• Convergence of ADMM for multi-block nonconvex separable optimization models (Q1690476) (← links)
• Rate of convergence to equilibrium and Łojasiewicz-type estimates (Q1692106) (← links)
• Asymptotic bias of stochastic gradient search (Q1704136) (← links)
• Extragradient method in optimization: convergence and complexity (Q1706412) (← links)
• The value function approach to convergence analysis in composite optimization (Q1709968) (← links)
• An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration (Q1716780) (← links)
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
• On definable multifunctions and Łojasiewicz inequalities (Q1746275) (← links)
• A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
• A cubic spline penalty for sparse approximation under tight frame balanced model (Q1986544) (← links)
• Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems (Q1987437) (← links)
• Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems (Q1991713) (← links)
• A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization (Q2000528) (← links)