A superlinear convergence framework for Kurdyka-Łojasiewicz optimization
From MaRDI portal
Cites work
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- A unified adaptive tensor approximation scheme to accelerate composite convex optimization
- Accelerated regularized Newton methods for minimizing composite convex functions
- Accelerating the cubic regularization of Newton's method on convex problems
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- An efficient DC programming approach for portfolio decision with higher moments
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- Cubic regularization of Newton method and its global performance
- Efficiency of higher-order algorithms for minimizing composite functions
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Inexact basic tensor methods for some classes of convex optimization problems
- Kurdyka-Łojasiewicz exponent via inf-projection
- Kurdyka-Łojasiewicz property of zero-norm composite functions
- Local convergence of tensor methods
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the quadratic convergence of the cubic regularization method under a local error bound condition
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal Newton-type methods for minimizing composite functions
- Solving High-Order Portfolios via Successive Convex Approximation Algorithms
- Sparse Reconstruction by Separable Approximation
- Two-Point Step Size Gradient Methods
- Variational Analysis
This page was built for publication: A superlinear convergence framework for Kurdyka-Łojasiewicz optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7289075)
