Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity.
Saved in:
| Title: | Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. |
|---|---|
| Authors: | Attouch, Hedy1, Redont, Patrick1, Chbani, Zaki2, Peypouquet, Juan3 |
| Source: | Mathematical Programming. Mar2018, Vol. 168 Issue 1/2, p123-175. 53p. |
| Subjects: | Robust convex optimization, Dynamical systems, Dynamics, Viscosity, Stochastic convergence |
| Abstract: | In a Hilbert space setting H |
| Copyright of Mathematical Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In a Hilbert space setting H<inline-graphic></inline-graphic>, we study the fast convergence properties as t→+∞<inline-graphic></inline-graphic> of the trajectories of the second-order differential equation x¨(t)+αtx˙(t)+∇Φ(x(t))=g(t),<graphic></graphic>where ∇Φ<inline-graphic></inline-graphic> is the gradient of a convex continuously differentiable function Φ:H→R,α<inline-graphic></inline-graphic> is a positive parameter, and g:[t0,+∞[→H<inline-graphic></inline-graphic> is a <italic>small</italic> perturbation term. In this inertial system, the viscous damping coefficient αt<inline-graphic></inline-graphic> vanishes asymptotically, but not too rapidly. For α≥3<inline-graphic></inline-graphic>, and ∫t0+∞t‖g(t)‖dt<+∞<inline-graphic></inline-graphic>, just assuming that argminΦ≠∅<inline-graphic></inline-graphic>, we show that any trajectory of the above system satisfies the fast convergence property Φ(x(t))-minHΦ≤Ct2.<graphic></graphic>Moreover, for α>3<inline-graphic></inline-graphic>, any trajectory converges weakly to a minimizer of Φ<inline-graphic></inline-graphic>. The strong convergence is established in various practical situations. These results complement the O(t-2)<inline-graphic></inline-graphic> rate of convergence for the values obtained by Su, Boyd and Candès in the unperturbed case g=0<inline-graphic></inline-graphic>. Time discretization of this system, and some of its variants, provides new fast converging algorithms, expanding the field of rapid methods for structured convex minimization introduced by Nesterov, and further developed by Beck and Teboulle with FISTA. This study also complements recent advances due to Chambolle and Dossal. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 00255610 |
| DOI: | 10.1007/s10107-016-0992-8 |