A forward-backward algorithm with different inertial terms for structured non-convex minimization problems
From MaRDI portal
Publication:6163956
DOI10.1007/s10957-023-02204-5zbMath1522.90131arXiv2002.07154OpenAlexW4365998929MaRDI QIDQ6163956
Publication date: 26 July 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.07154
global optimizationconvergence ratenon-convex optimizationKurdyka-Łojasiewicz inequalityabstract convergence theoreminertial proximal-gradient algorithmKL exponent
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Inertial Douglas-Rachford splitting for monotone inclusion 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
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- An inertial forward-backward algorithm for monotone inclusions
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On gradients of functions definable in o-minimal structures
- Introductory lectures on convex optimization. A basic course.
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of a splitting inertial proximal method for monotone operators
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems
- Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem
- An extension of the second order dynamical system that models Nesterov's convex gradient method
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
- Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- On damped second-order gradient systems
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- Activity Identification and Local Linear Convergence of Forward--Backward-type Methods
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Variational Analysis
- A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function
- Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods
- First-Order Methods in Optimization
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- Group sparse optimization via $\ell_{p,q}$ regularization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- Heavy-ball method in nonconvex optimization problems
