Accelerated and Inexact Forward-Backward Algorithms

DOI10.1137/110844805zbMath1295.90049OpenAlexW2019786292MaRDI QIDQ2866199

Silvia Villa, Alessandro Verri, Saverio Salzo, Luca Baldassarre

Publication date: 13 December 2013

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110844805

zbMATH Keywords

convex optimizationproximal pointproximity operatoraccelerated forward-backward spliting methodsaccelerated gradient descent algorithmsestimate sequenes

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Numerical methods based on necessary conditions (49M05)

Related Items

Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method ⋮ Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition ⋮ Stochastic forward-backward splitting for monotone inclusions ⋮ Subgradient method with feasible inexact projections for constrained convex optimization problems ⋮ Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA ⋮ Gradient sliding for composite optimization ⋮ Structured Sparsity: Discrete and Convex Approaches ⋮ Two algorithms for solving systems of inclusion problems ⋮ A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives ⋮ New convergence results for the inexact variable metric forward-backward method ⋮ Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant ⋮ Inexact first-order primal-dual algorithms ⋮ Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity ⋮ Inexact accelerated augmented Lagrangian methods ⋮ From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm ⋮ An inertial forward-backward algorithm for monotone inclusions ⋮ Accelerated differential inclusion for convex optimization ⋮ ``FISTA in Banach spaces with adaptive discretisations ⋮ Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection ⋮ A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization ⋮ Inexact successive quadratic approximation for regularized optimization ⋮ An inexact primal-dual method with correction step for a saddle point problem in image debluring ⋮ Convergence rates of accelerated proximal gradient algorithms under independent noise ⋮ Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients ⋮ Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization ⋮ Regularized learning schemes in feature Banach spaces ⋮ The multiproximal linearization method for convex composite problems ⋮ Doubly iteratively reweighted algorithm for constrained compressed sensing models ⋮ Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3 ⋮ Inexact proximal stochastic gradient method for convex composite optimization ⋮ Convergence rate of a relaxed inertial proximal algorithm for convex minimization ⋮ First order inertial optimization algorithms with threshold effects associated with dry friction ⋮ Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability ⋮ Convergence of inertial dynamics driven by sums of potential and nonpotential operators with implicit Newton-like damping ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Fast optimization via inertial dynamics with closed-loop damping ⋮ Sharper Bounds for Proximal Gradient Algorithms with Errors ⋮ A Riemannian Proximal Newton Method ⋮ Accelerated alternating descent methods for Dykstra-like problems ⋮ On FISTA with a relative error rule ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ Inexact gradient projection method with relative error tolerance ⋮ Applying FISTA to optimization problems (with or) without minimizers ⋮ Convergence Rates of Inertial Forward-Backward Algorithms ⋮ An inexact Riemannian proximal gradient method ⋮ Rate of convergence of inertial gradient dynamics with time-dependent viscous damping coefficient ⋮ Proximal methods for the latent group lasso penalty ⋮ Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope ⋮ Unnamed Item ⋮ Alternating Proximal Regularized Dictionary Learning ⋮ Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization ⋮ Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators ⋮ Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates ⋮ Consistent learning by composite proximal thresholding ⋮ Under-relaxed quasi-Newton acceleration for an inverse fixed-point problem coming from positron emission tomography ⋮ Fast convergence of generalized forward-backward algorithms for structured monotone inclusions ⋮ An introduction to continuous optimization for imaging ⋮ Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems ⋮ Convergence of stochastic proximal gradient algorithm ⋮ Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm ⋮ Bounds for the tracking error of first-order online optimization methods ⋮ A block coordinate variable metric linesearch based proximal gradient method ⋮ Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization ⋮ A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions ⋮ Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule ⋮ Conditional Gradient Sliding for Convex Optimization ⋮ Scaling Techniques for $\epsilon$-Subgradient Methods ⋮ The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$ ⋮ A Variable Metric Forward-Backward Method with Extrapolation ⋮ Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives ⋮ Sequence Convergence of Inexact Nonconvex and Nonsmooth Algorithms with More Realistic Assumptions ⋮ New strong convergence method for the sum of two maximal monotone operators ⋮ Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics ⋮ On the inexact scaled gradient projection method ⋮ Variable Metric Forward-Backward Algorithm for Composite Minimization Problems ⋮ Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone ⋮ Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping ⋮ Efficiency of minimizing compositions of convex functions and smooth maps ⋮ Convergence analysis of an inexact three-operator splitting algorithm ⋮ Accelerated Iterative Regularization via Dual Diagonal Descent ⋮ Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions ⋮ Unnamed Item ⋮ On the proximal Landweber Newton method for a class of nonsmooth convex problems ⋮ Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems ⋮ On the effect of perturbations in first-order optimization methods with inertia and Hessian driven damping ⋮ Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization ⋮ A nested primal-dual FISTA-like scheme for composite convex optimization problems ⋮ Implicit regularization with strongly convex bias: Stability and acceleration ⋮ An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints