Stability of Over-Relaxations for the Forward-Backward Algorithm, Application to FISTA

From MaRDI portal
Revision as of 21:14, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3454513


DOI10.1137/140994964zbMath1357.49123MaRDI QIDQ3454513

Jean-François Aujol, Charles Dossal

Publication date: 25 November 2015

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

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


90C25: Convex programming

49M29: Numerical methods involving duality

65K10: Numerical optimization and variational techniques

46N10: Applications of functional analysis in optimization, convex analysis, mathematical programming, economics


Related Items

The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$, Convergence Rates of Inertial Forward-Backward Algorithms, Unnamed Item, Unnamed Item, Convergence of a Piggyback-Style Method for the Differentiation of Solutions of Standard Saddle-Point Problems, Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3, Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery, Convergence rate of a relaxed inertial proximal algorithm for convex minimization, Finite Convergence of Proximal-Gradient Inertial Algorithms Combining Dry Friction with Hessian-Driven Damping, Optimal Convergence Rates for Nesterov Acceleration, Backtracking Strategies for Accelerated Descent Methods with Smooth Composite Objectives, Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics, An introduction to continuous optimization for imaging, Accelerated Iterative Regularization via Dual Diagonal Descent, Fast convex optimization via a third-order in time evolution equation, Implicit regularization with strongly convex bias: Stability and acceleration, Accelerated differential inclusion for convex optimization, ``FISTA in Banach spaces with adaptive discretisations, Accelerated dynamics with dry friction via time scaling and averaging of doubly nonlinear evolution equations, 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, Sharper Bounds for Proximal Gradient Algorithms with Errors, Regularized non-local total variation and application in image restoration, Accelerated alternating descent methods for Dykstra-like problems, Rate of convergence of inertial gradient dynamics with time-dependent viscous damping coefficient, Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization, On the proximal gradient algorithm with alternated inertia, Bounds for the tracking error of first-order online optimization methods, On the effect of perturbations in first-order optimization methods with inertia and Hessian driven damping, First-order optimization algorithms via inertial systems with Hessian driven damping, First-order inertial algorithms involving dry friction damping, Fast convergence of dynamical ADMM via time scaling of damped inertial dynamics, Convergence rates of a dual gradient method for constrained linear ill-posed problems, Inexact first-order primal-dual algorithms, Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients, Applying FISTA to optimization problems (with or) without minimizers, Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping, Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule, Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions, Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity, On FISTA with a relative error rule, Activity Identification and Local Linear Convergence of Forward--Backward-type Methods


Uses Software


Cites Work