AFSI: Adaptive Restart for Fast Semi-Iterative Schemes for Convex Optimisation

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Smooth optimisation problems arise in many fields including image processing, and having fast methods for solving them has clear benefits. Widely and successfully used strategies to solve them are accelerated gradient methods. They accelerate standard gradient-based schemes by means of extrapolation. Unfortunately, most acceleration strategies are generic, in the sense, that they ignore specific information about the objective function. In this paper, we implement an adaptive restarting into a recently proposed efficient acceleration strategy that was coined Fast Semi-Iterative (FSI) scheme. Our analysis shows clear advantages of the adaptive restarting in terms of a theoretical convergence rate guarantee and state-of-the-art performance on a challenging image processing task.

Cite

CITATION STYLE

APA

Tómasson, J. A., Ochs, P., & Weickert, J. (2019). AFSI: Adaptive Restart for Fast Semi-Iterative Schemes for Convex Optimisation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11269 LNCS, pp. 669–681). Springer Verlag. https://doi.org/10.1007/978-3-030-12939-2_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free