The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
On the ergodic convergence rates of a first-order primal–dual algorithm
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
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-citationMonotone 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
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
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
Problem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
Efficient projections onto the l1-ball for learning in high dimensions
Duchi, J., Shalev-Shwartz, S., Singer, Y., & Chandra, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390191 · Cited by 1,184
Mirror descent and nonlinear projected subgradient methods for convex optimization
Beck, A., & Teboulle, M. (2003) · Operations Research Letters · doi:10.1016/s0167-6377(02)00231-6 · Cited by 1,060
Condat, L. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0245-9 · Cited by 912
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
Nemirovski, A. (2004) · SIAM Journal on Optimization · doi:10.1137/s1052623403425629 · Cited by 750
Esser, E., Zhang, X., & Chan, T. F. (2010) · SIAM Journal on Imaging Sciences · doi:10.1137/09076934x · Cited by 695
An Inertial Forward-Backward Algorithm for Monotone Inclusions
Lorenz, D. A., & Pock, T. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0523-2 · Cited by 445
Self-citationHe, B., & Yuan, X. (2012) · SIAM Journal on Imaging Sciences · doi:10.1137/100814494 · Cited by 444
Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
Chen, G., & Teboulle, M. (1993) · SIAM Journal on Optimization · doi:10.1137/0803026 · Cited by 428
A proximal-based decomposition method for convex minimization problems
Chen, G., & Teboulle, M. (1994) · Mathematical Programming · doi:10.1007/bf01582566 · Cited by 392
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-citationNonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
Eckstein, J. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.1.202 · Cited by 324
Entropic Proximal Mappings with Applications to Nonlinear Programming
Teboulle, M. (1992) · Mathematics of Operations Research · doi:10.1287/moor.17.3.670 · Cited by 240
Optimal Primal-Dual Methods for a Class of Saddle Point Problems
Chen, Y., Lan, G., & Ouyang, Y. (2014) · SIAM Journal on Optimization · doi:10.1137/130919362 · Cited by 197
Shefi, R., & Teboulle, M. (2014) · SIAM Journal on Optimization · doi:10.1137/130910774 · Cited by 180
Boţ, R. I., Csetnek, E. R., Heinrich, A., & Hendrich, C. (2014) · Mathematical Programming · doi:10.1007/s10107-014-0766-0 · Cited by 81
Cited by
An introduction to continuous optimization for imaging
Chambolle, A., & Pock, T. (2016) · Acta Numerica · doi:10.1017/s096249291600009x · Cited by 545
Self-citationScaling algorithms for unbalanced optimal transport problems
Chizat, L., Peyré, G., Schmitzer, B., & Vialard, F.-X. (2018) · Mathematics of Computation · doi:10.1090/mcom/3303 · Cited by 336
Metadata
- Authors
- Chambolle, A., & Pock, T.
- Venue
- Mathematical Programming
- Published
- 2015-10-30
- Volume
- 159
- Issue
- 1-2
- Pages
- 253-287
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2241435520
- Cited by
- 411
- References
- 25
- FWCI
- 25.62
- Type
- journal article
- Language
- en
- Open access
- closed
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.