Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
From MaRDI portal
Publication:2297644
DOI10.1007/S10107-018-1350-9zbMATH Open1439.90055OpenAlexW2731666329WikidataQ128958446 ScholiaQ128958446MaRDI QIDQ2297644FDOQ2297644
Authors: Vassilis Apidopoulos, Jean-François Aujol, Charles Dossal 
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
Recommendations
- Convergence rates of inertial forward-backward algorithms
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- Convergence rate of a relaxed inertial proximal algorithm for convex minimization
- Accelerated and inexact forward-backward algorithms
- A dynamical approach to an inertial forward-backward algorithm for convex minimization
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Title not available (Why is that?)
- Signal Recovery by Proximal Forward-Backward Splitting
- Accelerated and inexact forward-backward algorithms
- Inexact and accelerated proximal point algorithms
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- Optimized first-order methods for smooth convex minimization
- On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
- New Proximal Point Algorithms for Convex Minimization
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)
- Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$
- Convergence rates of inertial forward-backward algorithms
- Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions
Cited In (43)
- Finite-time stabilization of continuous inertial dynamics combining dry friction with Hessian-driven damping
- Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics
- Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics
- Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems
- Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping
- A class of modified accelerated proximal gradient methods for nonsmooth and nonconvex minimization problems
- Convergence rates of inertial forward-backward algorithms
- Fast optimization of charged particle dynamics with damping
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
- Fast optimization via inertial dynamics with closed-loop damping
- Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization
- Incorporating history and deviations in forward-backward splitting
- 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
- Accelerated methods with fastly vanishing subgradients for structured non-smooth minimization
- Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition
- Convergence of iterates for first-order optimization algorithms with inertia and Hessian driven damping
- Newton-like inertial dynamics and proximal algorithms governed by maximally monotone operators
- A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
- On the interplay between acceleration and identification for the proximal gradient algorithm
- Continuous Newton-like inertial dynamics for monotone inclusions
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- From the ravine method to the Nesterov method and vice versa: a dynamical system perspective
- Fast convergence rate of values with strong convergence of trajectories via inertial dynamics with Tikhonov regularization terms and asymptotically vanishing damping
- Second order splitting dynamics with vanishing damping for additively structured monotone inclusions
- The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$
- Fast convex optimization via a third-order in time evolution equation: TOGES-V an improved version of TOGES*
- On the effect of perturbations in first-order optimization methods with inertia and Hessian driven damping
- Fast convex optimization via inertial dynamics combining viscous and Hessian-driven damping with time rescaling
- First-order optimization algorithms via inertial systems with Hessian driven damping
- Accelerated iterative regularization via dual diagonal descent
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
- A doubly nonlinear evolution system with threshold effects associated with dry friction
- Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition
- Fast convex optimization via a third-order in time evolution equation
- Tikhonov regularization of a perturbed heavy ball system with vanishing damping
- Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems
- Finite convergence of proximal-gradient inertial algorithms combining dry friction with Hessian-driven damping
- On a new simple algorithm to compute the resolvents
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3
- Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients
- A forward-backward algorithm with different inertial terms for structured non-convex minimization problems
This page was built for publication: Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297644)
