Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
From MaRDI portal
Publication:2297644
DOI10.1007/s10107-018-1350-9zbMath1439.90055OpenAlexW2731666329WikidataQ128958446 ScholiaQ128958446MaRDI QIDQ2297644
Jean-François Aujol, Charles Dossal, Vassilis Apidopoulos
Publication date: 20 February 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1350-9
Related Items (36)
Fast convex optimization via inertial dynamics combining viscous and Hessian-driven damping with time rescaling ⋮ Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition ⋮ Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization ⋮ First-order optimization algorithms via inertial systems with Hessian driven damping ⋮ Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics ⋮ Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems ⋮ Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization ⋮ From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective ⋮ Convergence of iterates for first-order optimization algorithms with inertia and Hessian driven damping ⋮ On the strong convergence of the trajectories of a Tikhonov regularized second order dynamical system with asymptotically vanishing damping ⋮ Accelerated dynamics with dry friction via time scaling and averaging of doubly nonlinear evolution equations ⋮ Unnamed Item ⋮ Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients ⋮ Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3 ⋮ A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems ⋮ A forward-backward algorithm with different inertial terms for structured non-convex minimization problems ⋮ On a new simple algorithm to compute the resolvents ⋮ Fast optimization via inertial dynamics with closed-loop damping ⋮ Fast convex optimization via a third-order in time evolution equation: TOGES-V an improved version of TOGES* ⋮ Second order splitting dynamics with vanishing damping for additively structured monotone inclusions ⋮ Finite Convergence of Proximal-Gradient Inertial Algorithms Combining Dry Friction with Hessian-Driven Damping ⋮ The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$ ⋮ Newton-like Inertial Dynamics and Proximal Algorithms Governed by Maximally Monotone Operators ⋮ Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization ⋮ Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping ⋮ Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization ⋮ Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions ⋮ On the interplay between acceleration and identification for the proximal gradient algorithm ⋮ Continuous Newton-like inertial dynamics for monotone inclusions ⋮ Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics ⋮ Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems ⋮ Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition ⋮ Accelerated Iterative Regularization via Dual Diagonal Descent ⋮ Tikhonov Regularization of a Perturbed Heavy Ball System with Vanishing Damping ⋮ Fast convex optimization via a third-order in time evolution equation ⋮ On the effect of perturbations in first-order optimization methods with inertia and Hessian driven damping
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Optimized first-order methods for smooth convex minimization
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Accelerated and Inexact Forward-Backward Algorithms
- Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA
- New Proximal Point Algorithms for Convex Minimization
- The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$
- Convergence Rates of Inertial Forward-Backward Algorithms
- Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3
- Signal Recovery by Proximal Forward-Backward Splitting
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
