Pages that link to "Item:Q2251554"
From MaRDI portal
The following pages link to Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality (Q2251554):
Displayed 26 items.
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- Semicoercive variational inequalities: from existence to numerical solution of nonmonotone contact problems (Q346802) (← links)
- Branch and bound algorithm with applications to robust stability (Q513164) (← links)
- Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
- Proximal algorithms in statistics and machine learning (Q1790304) (← links)
- A block coordinate variable metric linesearch based proximal gradient method (Q1790669) (← links)
- A bundle method for nonsmooth DC programming with application to chance-constrained problems (Q2028493) (← links)
- Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis (Q2116020) (← links)
- A survey on some recent developments of alternating direction method of multipliers (Q2136506) (← links)
- Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates (Q2349844) (← links)
- Non-smooth non-convex Bregman minimization: unification and new algorithms (Q2420780) (← links)
- An abstract convergence framework with application to inertial inexact forward-backward methods (Q2696904) (← links)
- Robust eigenstructure clustering by non-smooth optimisation (Q2797619) (← links)
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs (Q2806813) (← links)
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality (Q2954392) (← links)
- Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds (Q4609464) (← links)
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano (Q4624932) (← links)
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints (Q4976346) (← links)
- A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities (Q5116553) (← links)
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
- Worst‐case stability and performance with mixed parametric and dynamic uncertainties (Q5739105) (← links)
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs (Q5868963) (← links)
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods (Q5883316) (← links)
- A gradient sampling algorithm for stratified maps with applications to topological data analysis (Q6052059) (← links)