Local convergence of the heavy-ball method and iPiano for non-convex optimization
From MaRDI portal
Publication:1637355
DOI10.1007/s10957-018-1272-yzbMath1404.90105arXiv1606.09070OpenAlexW2962834223MaRDI QIDQ1637355
Publication date: 8 June 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.09070
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)
Related Items
Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization ⋮ Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients ⋮ Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions ⋮ A Regularized Newton Method for \({\boldsymbol{\ell}}_{q}\) -Norm Composite Optimization Problems ⋮ Inertial Newton algorithms avoiding strict saddle points ⋮ A forward-backward algorithm with different inertial terms for structured non-convex minimization problems ⋮ Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization ⋮ Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity ⋮ Inertial proximal incremental aggregated gradient method with linear convergence guarantees ⋮ Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems
Uses Software
Cites Work
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- A block coordinate variable metric forward-backward algorithm
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Local linear convergence for alternating and averaged nonconvex projections
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Convergence to equilibrium for the backward Euler scheme and applications
- On gradients of functions definable in o-minimal structures
- On semi- and subanalytic geometry
- From error bounds to the complexity of first-order descent methods for convex functions
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- 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 non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
- Differential properties of the Moreau envelope
- A nonsmooth Morse--Sard theorem for subanalytic functions
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Integration of subdifferentials of nonconvex functions
- Variational Analysis
- Local differentiability of distance functions
- Prox-regular functions in variational analysis
- On Iteratively Reweighted Algorithms for Nonsmooth Nonconvex Optimization in Computer Vision
- On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
- Alternating Projections on Manifolds
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- Heavy-ball method in nonconvex optimization problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
