A Generic online acceleration scheme for Optimization algorithms via Relaxation and Inertia
Not on the map. Why?
Abstract (arXiv)
We propose generic acceleration schemes for a wide class of optimization and iterative schemes based on relaxation and inertia. In particular, we introduce methods that automatically tunes the acceleration coefficients online, and establish their convergence. This is made possible by considering the class of fixed-points iterations over averaged operators which encompass gradient methods, ADMM, primal dual algorithms, an so on.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Mar 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 2.
3 papers.