Pages that link to "Item:Q3503208"
From MaRDI portal
The following pages link to Clarke Subgradients of Stratifiable Functions (Q3503208):
Displaying 50 items.
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- Ł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)
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems (Q312683) (← links)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- Semi-algebraic functions have small subdifferentials (Q359626) (← links)
- The Morse-Sard theorem for Clarke critical values (Q387044) (← 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)
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function (Q467409) (← links)
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality (Q494873) (← links)
- A new alternating direction method for linearly constrained nonconvex optimization problems (Q496618) (← links)
- Dual descent methods as tension reduction systems (Q727232) (← links)
- A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
- A proximal point-type method for multicriteria optimization (Q741360) (← links)
- Quadratic growth and critical point stability of semi-algebraic functions (Q747778) (← links)
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
- Tensor train rank minimization with hybrid smoothness regularization for visual data recovery (Q821724) (← links)
- Bregman proximal gradient algorithms for deep matrix factorization (Q826170) (← links)
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems (Q829490) (← links)
- Transversality and alternating projections for nonconvex sets (Q895706) (← links)
- A scalarization proximal point method for quasiconvex multiobjective minimization (Q905757) (← links)
- On the first integral conjecture of René Thom (Q950543) (← links)
- Asymptotic behaviour of self-contracted planar curves and gradient orbits of convex functions (Q987849) (← links)
- Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← 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)
- Peaceman-Rachford splitting for a class of nonconvex optimization problems (Q1687318) (← links)
- Convergence of ADMM for multi-block nonconvex separable optimization models (Q1690476) (← 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)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← 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)
- Inertial alternating generalized forward-backward splitting for image colorization (Q1999474) (← links)
- A new globally convergent algorithm for non-Lipschitz \(\ell_{p}-\ell_q\) minimization (Q2000528) (← links)
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems (Q2026765) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm (Q2031758) (← links)
- Maximum time step for the BDF3 scheme applied to gradient flows (Q2035643) (← links)
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning (Q2039229) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- Incremental without replacement sampling in nonconvex optimization (Q2046568) (← links)
