A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives
Open Journal of Mathematical Optimization · 2022
DOI: 10.5802/ojmo.12 ↗Kurz gefasst
Fachartikel in der Zeitschrift Open Journal of Mathematical Optimization, 2022. Verfasst von Mathieu Barré und 2 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 38 Literaturangaben.
Abstract (Originalsprache)
In this short note, we provide a simple version of an accelerated forward-backward method (a.k.a. Nesterov’s accelerated proximal gradient method) possibly relying on approximate proximal operators and allowing to exploit strong convexity of the objective function. The method supports both relative and absolute errors, and its behavior is illustrated on a set of standard numerical experiments. Using the same developments, we further provide a version of the accelerated proximal hybrid extragradient method of [21] possibly exploiting strong convexity of the objective function.
Zitieren
APA
Barré, M., Taylor, A., & Bach, F. (2022). A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives. Open Journal of Mathematical Optimization. https://doi.org/10.5802/ojmo.12
Vancouver
Barré M, Taylor A, Bach F. A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives. Open Journal of Mathematical Optimization. 2022. doi:10.5802/ojmo.12
BibTeX
@article{Barr2022,
author = {Barré, Mathieu and Taylor, Adrien and Bach, Francis},
title = {A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives},
journal = {Open Journal of Mathematical Optimization},
year = {2022},
doi = {10.5802/ojmo.12}
}
EUVIMED