Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 277

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity

Open access
Attouch, Hedy, Chbani, Zaki, Peypouquet, Juan, Redont, Patrick·2018·Mathematical Programming

Abstract

In a Hilbert space setting $${{\mathcal {H}}}$$H, we study the fast convergence properties as $$t \rightarrow + \infty $$t→+∞ of the trajectories of the second-order differential equation $$\begin{aligned} \ddot{x}(t) + \frac{\alpha }{t} \dot{x}(t) + \nabla \Phi (x(t)) = g(t), \end{aligned}$$x¨(t)+αtx˙(t)+∇Φ(x(t))=g(t),where $$\nabla \Phi $$∇Φ is the gradient of a convex continuously differentiable function $$\Phi : {{\mathcal {H}}} \rightarrow {{\mathbb {R}}}, \alpha $$Φ:H→R,α is a positive parameter, and $$g: [t_0, + \infty [ \rightarrow {{\mathcal {H}}}$$g:[t0,+∞[→H is a small perturbation term. In this inertial system, the viscous damping coefficient $$\frac{\alpha }{t}$$αt vanishes asymptotically, but not too rapidly. For $$\alpha \ge 3$$α≥3, and $$\int _{t_0}^{+\infty } t \Vert g(t)\Vert dt < + \infty $$∫t0+∞t‖g(t)‖dt<+∞, just assuming that $${{\mathrm{argmin\,}}}\Phi \ne \emptyset $$argminΦ≠∅, we show that any trajectory of the above system satisfies the fast convergence property $$\begin{aligned} \Phi (x(t))- \min _{{{\mathcal {H}}}}\Phi \le \frac{C}{t^2}. \end{aligned}$$Φ(x(t))-minHΦ≤Ct2.Moreover, for $$\alpha > 3$$α>3, any trajectory converges weakly to a minimizer of $$\Phi $$Φ. The strong convergence is established in various practical situations. These results complement the $${{\mathcal {O}}}(t^{-2})$$O(t-2) rate of convergence for the values obtained by Su, Boyd and Candès in the unperturbed case $$g=0$$g=0. 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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s10107-016-0992-8

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 277

Metadata

Authors
Attouch, H., Chbani, Z., Peypouquet, J., & Redont, P.
Venue
Mathematical Programming
Published
2016-03-24
Volume
168
Issue
1-2
Pages
123-175
ISSN
  • 0025-5610 (ISSN-L)
  • 1436-4646
OpenAlex
W2302721240
Cited by
277
References
2
FWCI
14.59
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. https://app.cochat.ai/papers/10.1007/s10107-016-0992-8
The paper
Attouch, H., Chbani, Z., Peypouquet, J., & Redont, P. (2018). Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity. Mathematical Programming. https://doi.org/10.1007/s10107-016-0992-8

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.