The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
An Inertial Forward-Backward Algorithm for Monotone Inclusions
Open accessAbstract
In this paper, we propose an inertial forward-backward splitting algorithm to compute a zero of the sum of two monotone operators, with one of the two operators being co-coercive. The algorithm is inspired by the accelerated gradient method of Nesterov, but can be applied to a much larger class of problems including convex-concave saddle point problems and general monotone inclusions. We prove convergence of the algorithm in a Hilbert space setting and show that several recently proposed first-order methods can be obtained as special cases of the general algorithm. Numerical results show that the proposed algorithm converges faster than existing methods, while keeping the computational cost of each iteration basically unchanged.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
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
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Chambolle, A., & Pock, T. (2011) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-010-0251-1 · Cited by 4,336
Self-citationThe Split Bregman Method for L1-Regularized Problems
Goldstein, T., & Osher, S. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080725891 · Cited by 4,282
Monotone Operators and the Proximal Point Algorithm
Rockafellar, R. T. (1976) · SIAM Journal on Control and Optimization · doi:10.1137/0314056 · Cited by 3,559
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2017) · CMS Books in Mathematics · doi:10.1007/978-3-319-48311-5 · Cited by 3,307
The Numerical Solution of Parabolic and Elliptic Differential Equations
Peaceman, D. W., & Rachford, Jr. (1955) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0103003 · Cited by 3,255
Some methods of speeding up the convergence of iteration methods
Polyak, B. T. (1964) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(64)90137-5 · Cited by 3,069
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2011) · CMS Books in Mathematics · doi:10.1007/978-1-4419-9467-7 · Cited by 2,962
Eckstein, J., & Bertsekas, D. P. (1992) · Mathematical Programming · doi:10.1007/bf01581204 · Cited by 2,791
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
A method for solving the convex programming problem with convergence rate O(1/k^2)
Nesterov, Y. E. (1983) · Доклады Академии наук · Cited by 2,662
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Weak convergence of the sequence of successive approximations for nonexpansive mappings
Opial, Z. (1967) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1967-11761-0 · Cited by 2,340
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
On the numerical solution of heat conduction problems in two and three space variables
Douglas, J., & Rachford, H. H. (1956) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1956-0084194-4 · Cited by 1,744
Proximité et dualité dans un espace hilbertien
Moreau, J. J. (1965) · Bulletin de la Société mathématique de France · doi:10.24033/bsmf.1625 · Cited by 1,462
Gradient methods for minimizing composite functions
Nesterov, Y. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0629-5 · Cited by 1,298
Monotone (nonlinear) operators in Hilbert space
Minty, G. J. (1962) · Duke Mathematical Journal · doi:10.1215/s0012-7094-62-02933-2 · Cited by 1,135
Condat, L. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0245-9 · Cited by 912
Constrained minimization methods
Levitin, E. S., & Polyak, B. T. (1966) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(66)90114-5 · Cited by 846
Esser, E., Zhang, X., & Chan, T. F. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/09076934x · Cited by 695
Efficient Online and Batch Learning Using Forward Backward Splitting
Duchi, J. C., & Singer, Y. (2009) · Journal of Machine Learning Research · Cited by 687
On the Convergence of the Proximal Point Algorithm for Convex Minimization
Güler, O. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329022 · Cited by 681
Convex programming in Hilbert space
Goldstein, A. A. (1964) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1964-11178-2 · Cited by 633
Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
Passty, G. B. (1979) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(79)90234-8 · Cited by 609
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Chapter IX Applications of the Method of Multipliers to Variational Inequalities
Gabay, D. (1983) · Studies in mathematics and its applications · doi:10.1016/s0168-2024(08)70034-1 · Cited by 422
Brève communication. Régularisation d'inéquations variationnelles par approximations successives
Martinet, B. (1970) · Revue française d'informatique et de recherche opérationnelle. Série rouge · doi:10.1051/m2an/197004r301541 · Cited by 422
Diagonal preconditioning for first order primal-dual algorithms in convex optimization
Pock, T., & Chambolle, A. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126441 · Cited by 393
Self-citationHe, B., & Yuan, X. (2012) · SIAM Journal on Imaging Sciences · doi:10.1137/100814494 · Cited by 378
Combettes, P. L., & Pesquet, J.-C. (2011) · Set-Valued and Variational Analysis · doi:10.1007/s11228-011-0191-y · Cited by 371
An algorithm for minimizing the Mumford-Shah functional
Pock, T., Cremers, D., Bischof, H., & Chambolle, A. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459348 · Cited by 353
Self-citationA Generalized Forward-Backward Splitting
Raguet, H., Fadili, J., & Peyré, G. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120872802 · Cited by 352
Convergence Rates in Forward--Backward Splitting
Chen, G. H.-G., & Rockafellar, R. T. (1997) · SIAM Journal on Optimization · doi:10.1137/s1052623495290179 · Cited by 285
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
Splitting methods for monotone operators with applications to parallel optimization
Eckstein, J. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 250
Chouzenoux, E., Pesquet, J.-C., & Repetti, A. (2014) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-013-0465-7 · Cited by 206
Accelerated and Inexact Forward-Backward Algorithms
Villa, S., Salzo, S., Baldassarre, L., & Verri, A. (2013) · SIAM Journal on Optimization · doi:10.1137/110844805 · Cited by 197
Bruck, R. E. (1977) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(77)90152-4 · Cited by 166
A Parallel Inertial Proximal Optimization Method
Pesquet, J.-C., & Pustelnik, N. (2012) · HAL · Cited by 120
A quasi-Newton proximal splitting methodPreprint
Becker, S., & Fadili, J. M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.1156 · Cited by 107
Cited by
On the ergodic convergence rates of a first-order primal–dual algorithm
Chambolle, A., & Pock, T. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0957-3 · Cited by 411
Self-citationOn the Convergence of the Iterates of the “Fast Iterative Shrinkage/Thresholding Algorithm”
Chambolle, A., & Dossal, C. (2015) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-015-0746-4 · Cited by 400
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
Attouch, H., & Peypouquet, J. (2016) · SIAM Journal on Optimization · doi:10.1137/15m1046095 · Cited by 273
An operator splitting approach for distributed generalized Nash equilibria computation
Yi, P., & Pavel, L. (2019) · Automatica · doi:10.1016/j.automatica.2019.01.008 · Cited by 271
Metadata
- Authors
- Lorenz, D. A., & Pock, T.
- Venue
- Journal of Mathematical Imaging and Vision
- Published
- 2014-07-17
- Volume
- 51
- Issue
- 2
- Pages
- 311-325
- ISSN
- 0924-9907 (ISSN-L)
- 1573-7683
- OpenAlex
- W2095980290
- Cited by
- 445
- References
- 46
- FWCI
- 18.42
- 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.