Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
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
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
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
Iterative hard thresholding for compressed sensing
Blumensath, T., & Davies, M. E. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.04.002 · Cited by 2,275
Nonsmooth Analysis and Control Theory
(1998) · Graduate Texts in Mathematics · doi:10.1007/b97650 · Cited by 1,962
Bochnak, J., Coste, M., & Roy, M.-F. (1998) · Springer · doi:10.1007/978-3-662-03718-8 · Cited by 1,538 · cited 1×
“When C is nonempty, the closedness of C and the compactness of the closed unit ball imply that PC(x) is nonempty for all x in R n.”
BackgroundExact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
(2014) · Choice Reviews Online · doi:10.5860/choice.51-3296 · Cited by 1,260
Iterative Thresholding for Sparse Approximations
Blumensath, T., & Davies, M. E. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9035-z · Cited by 1,248
Attouch, H., Bolte, J., Redont, P., & Soubeyran, A. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0449 · Cited by 1,172
Self-citationAsymptotics for a Class of Non-Linear Evolution Equations, with Applications to Geometric Problems
Simon, L. (1983) · The Annals of Mathematics · doi:10.2307/2006981 · Cited by 729
Bolte, J., Daniilidis, A., & Lewis, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050644641 · Cited by 671
Self-citationGeometric categories and o-minimal structures
van den Dries, L., & Miller, C. (1996) · Duke Mathematical Journal · doi:10.1215/s0012-7094-96-08416-1 · Cited by 573
On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Attouch, H., & Bolte, J. (2007) · Mathematical Programming · doi:10.1007/s10107-007-0133-5 · Cited by 568
Self-citationOn gradients of functions definable in o-minimal structures
Kurdyka, K. (1998) · Annales de l'Institut Fourier · doi:10.5802/aif.1638 · Cited by 461
The method of steepest descent for non-linear minimization problems
Curry, H. B. (1944) · Quarterly of Applied Mathematics · doi:10.1090/qam/10667 · Cited by 437
Nailon, W. H., McLaughlin, S., Spencer, T., & Ramo, M. P. (2002) · Proceedings of 3rd IEEE International Conference on Image Processing · doi:10.1109/icip.1996.560490 · Cited by 402
Convergence of the Iterates of Descent Methods for Analytic Cost Functions
Absil, P. A., Mahony, R., & Andrews, B. (2005) · SIAM Journal on Optimization · doi:10.1137/040605266 · Cited by 291
Alternating Projections on Manifolds
Lewis, A. S., & Malick, J. (2008) · Mathematics of Operations Research · doi:10.1287/moor.1070.0291 · Cited by 221
Sur la géométrie semi- et sous- analytique
Łojasiewicz, S. (1993) · Annales de l'Institut Fourier · doi:10.5802/aif.1384 · Cited by 203
A proximal method for composite minimization
Lewis, A. S., & Wright, S. J. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0943-9 · Cited by 167
Descent methods for composite nondifferentiable optimization problems
Burke, J. V. (1985) · Mathematical Programming · doi:10.1007/bf01584377 · Cited by 119
A nonsmooth Morse–Sard theorem for subanalytic functions
Bolte, J., Daniilidis, A., & Lewis, A. S. (2005) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2005.07.068 · Cited by 41
Self-citationLocal Search Proximal Algorithms as Decision Dynamics with Costs to Move
Attouch, H., & Soubeyran, A. (2010) · Set-Valued and Variational Analysis · doi:10.1007/s11228-010-0139-7 · Cited by 30
Self-citationA Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems
Beck, A., & Teboulle, M. (2011) · Springer optimization and its applications · doi:10.1007/978-1-4419-9569-8_3 · Cited by 26
Pointwise convergence of gradient‐like systems
Lageman, C. (2007) · Mathematische Nachrichten · doi:10.1002/mana.200410564 · Cited by 22
Cited by
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Bolte, J., Sabach, S., & Teboulle, M. (2014) · Mathematical Programming · doi:10.1007/s10107-013-0701-9 · Cited by 1,688
Self-citationA Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
Wang, Y., Yin, W., & Zeng, J. (2019) · Journal of Scientific Computing · doi:10.1007/s10915-018-0757-z · Cited by 1,268
Fusing Hyperspectral and Multispectral Images via Coupled Sparse Tensor Factorization
Li, S., Dian, R., Fang, L., & Bioucas-Dias, J. M. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2836307 · Cited by 585
An introduction to continuous optimization for imaging
Chambolle, A., & Pock, T. (2016) · Acta Numerica · doi:10.1017/s096249291600009x · Cited by 545
Metadata
- Authors
- Attouch, H., Bolte, J., & Svaiter, B. F.
- Venue
- Mathematical Programming
- Published
- 2011-08-20
- Volume
- 137
- Issue
- 1-2
- Pages
- 91-129
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1967138577
- Cited by
- 1,414
- References
- 28
- FWCI
- 19.73
- 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.