The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
Open accessAbstract
We introduce a new class of forward-backward algorithms for structured convex minimization problems in Hilbert spaces. Our approach relies on the time discretization of a second-order differential system with two potentials and Hessian-driven damping, recently introduced in [H. Attouch, P.-E. Maingé, and P. Redont, Differ. Equ. Appl., 4 (2012), pp. 27--65]. This system can be equivalently written as a first-order system in time and space, each of the two constitutive equations involving one (and only one) of the two potentials. Its time dicretization naturally leads to the introduction of forward-backward splitting algorithms with inertial features. Using a Liapunov analysis, we show the convergence of the algorithm under conditions enlarging the classical step size limitation. Then, we specialize our results to gradient-projection algorithms and give some illustrations of sparse signal recovery and feasibility problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Cited by
Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
Attouch, H., Chbani, Z., Peypouquet, J., & Redont, P. (2018) · Mathematical Programming · doi:10.1007/s10107-016-0992-8 · Cited by 277
Self-citationInertial projection and contraction algorithms for variational inequalities
Dong, Q. L., Cho, Y. J., Zhong, L. L., & Rassias, T. M. (2018) · Journal of Global Optimization · doi:10.1007/s10898-017-0506-0 · Cited by 267
Inertial Douglas–Rachford splitting for monotone inclusion problems
Boţ, R. I., Csetnek, E. R., & Hendrich, C. (2015) · Applied Mathematics and Computation · doi:10.1016/j.amc.2015.01.017 · Cited by 257
Metadata
- Authors
- Attouch, H., Peypouquet, J., & Redont, P.
- Venue
- SIAM Journal on Optimization
- Published
- 2014-01
- Volume
- 24
- Issue
- 1
- Pages
- 232-256
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2078616944
- Cited by
- 194
- References
- 1
- FWCI
- 13.06
- 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
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.