Pages that link to "Item:Q3566718"
From MaRDI portal
The following pages link to Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity (Q3566718):
Displaying 50 items.
- 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)
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity (Q334319) (← 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)
- 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)
- Nonlinear error bounds via a change of function (Q511953) (← links)
- Stability of saddle points via explicit coderivatives of pointwise subdifferentials (Q526389) (← links)
- Bounding regions to plane steepest descent curves of quasiconvex families (Q670243) (← links)
- Dual descent methods as tension reduction systems (Q727232) (← links)
- A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\) (Q730526) (← links)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems (Q829490) (← links)
- Asymptotic behaviour of self-contracted planar curves and gradient orbits of convex functions (Q987849) (← links)
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors (Q1616037) (← links)
- A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions (Q1630270) (← 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)
- 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)
- Rate of convergence to equilibrium and Łojasiewicz-type estimates (Q1692106) (← links)
- Extragradient method in optimization: convergence and complexity (Q1706412) (← links)
- Learning in games with continuous action sets and unknown payoff functions (Q1717237) (← 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)
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems (Q1991713) (← links)
- Rectifiability of non Euclidean planar self-contracted curves (Q2012213) (← links)
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions (Q2020604) (← links)
- Kurdyka-Łojasiewicz property of zero-norm composite functions (Q2026719) (← links)
- Maximum time step for the BDF3 scheme applied to gradient flows (Q2035643) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- Level-set subdifferential error bounds and linear convergence of Bregman proximal gradient method (Q2046546) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- On the convergence to equilibria of a sequence defined by an implicit scheme (Q2063987) (← links)
- Curiosities and counterexamples in smooth convex optimization (Q2089782) (← links)
- A control-theoretic perspective on optimal high-order optimization (Q2089793) (← links)
- Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition (Q2089864) (← links)
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization (Q2089885) (← links)
- Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
- Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition (Q2128612) (← links)
- Quantitative analysis of a subgradient-type method for equilibrium problems (Q2129632) (← links)
- A survey on some recent developments of alternating direction method of multipliers (Q2136506) (← links)
