Convergence rate of a relaxed inertial proximal algorithm for convex minimization
Authors:
- 4 December 2019
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 69 (6) , 1281-1312
Abstract
In a Hilbert space setting, the authors recently introduced a general class of relaxed inertial proximal algorithms that aim to solve monotone inclusions. In this paper, we specialize this study in the case of non-smooth convex minimization problems. We obtain convergence rates for values which have similarities with the results based on the Nesterov accelerated gradient method. The joint adjustment of inertia, relaxation and proximal terms plays a central role. In doing so, we highlight inertial proximal algorithms that converge for general monotone inclusions, and which, in the case of convex minimization, give fast convergence rates of values in the worst case.Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- On the Convergence of the Iterates of the “Fast Iterative Shrinkage/Thresholding Algorithm”Journal of Optimization Theory and Applications, 2015
- Performance of first-order methods for smooth convex minimization: a novel approachMathematical Programming, 2013
- Accelerated and Inexact Forward-Backward AlgorithmsSIAM Journal on Optimization, 2013
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Convergence theorems for inertial KM-type algorithmsJournal of Computational and Applied Mathematics, 2008
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert SpaceSIAM Journal on Optimization, 2004
- On the Minimizing Property of a Second Order Dissipative System in Hilbert SpacesSIAM Journal on Control and Optimization, 2000
- On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operatorsMathematical Programming, 1992
- Weak convergence of the sequence of successive approximations for nonexpansive mappingsBulletin of the American Mathematical Society, 1967
- Some methods of speeding up the convergence of iteration methodsUSSR Computational Mathematics and Mathematical Physics, 1964