The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Convergence of the Iterates of Descent Methods for Analytic Cost Functions
Abstract
In the early eighties Lojasiewicz [in Seminari di Geometria 1982-1983, Università di Bologna, Istituto di Geometria, Dipartimento di Matematica, 1984, pp. 115--117] proved that a bounded solution of a gradient flow for an analytic cost function converges to a well-defined limit point. In this paper, we show that the iterates of numerical descent algorithms, for an analytic cost function, share this convergence property if they satisfy certain natural descent conditions. The results obtained are applicable to a broad class of optimization schemes and strengthen classical "weak convergence" results for descent methods to "strong limit-point convergence" for a large class of cost functions of practical interest. The result does not require that the cost has isolated critical points and requires no assumptions on the convexity of the cost nor any nondegeneracy conditions on the Hessian of the cost at critical points.
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.
Integrity signals
Registry
Cites
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.
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
Introduction to Applied Nonlinear Dynamical Systems and Chaos
Wiggins, S., & Mazel, D. S. (1990) · Computers in Physics · doi:10.1063/1.4822950 · Cited by 3,780
Conn, A. R., Gould, N. I. M., & Toint, P. L. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719857 · Cited by 2,981
Moré, J. J., & Sorensen, D. C. (1983) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0904038 · Cited by 1,411
Convergence Conditions for Ascent Methods
Wolfe, P. (1969) · SIAM Review · doi:10.1137/1011036 · Cited by 1,106
Practical methods of optimization; (2nd ed.)
Fletcher, R. (1987) · Wiley-Interscience eBooks · Cited by 964
Introduction to Applied Nonlinear Dynamical Systems and Chaos
(2003) · Texts in Applied Mathematics · doi:10.1007/b97481 · Cited by 905
The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Steihaug, T. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720042 · Cited by 824
Optimization and Dynamical Systems
Helmke, U., & Moore, J. B. (1994) · Communications and Control Engineering · doi:10.1007/978-1-4471-3467-1 · Cited by 724
Semianalytic and subanalytic sets
Bierstone, E., & Milman, P. D. (1988) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02699126 · Cited by 671
Łojasiewicz, S. (1965) · Medical Entomology and Zoology · Cited by 520
On gradients of functions definable in o-minimal structures
Kurdyka, K. (1998) · Annales de l'Institut Fourier · doi:10.5802/aif.1638 · Cited by 461
A New Algorithm for Unconstrained Optimization
POWELL, M. J. D. (1970) · Nonlinear Programming · doi:10.1016/b978-0-12-597050-1.50006-3 · Cited by 447
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
Approximate solution of the trust region problem by minimization over two-dimensional subspaces
Byrd, R. H., Schnabel, R. B., & Shultz, G. A. (1988) · Mathematical Programming · doi:10.1007/bf01580735 · Cited by 411
Sur le problème de la division
Łojasiewicz, S. (1959) · Studia Mathematica · doi:10.4064/sm-18-1-87-136 · Cited by 300
Goldstein, A. A. (1965) · SIAM Journal on Control · doi:10.1137/0303013 · Cited by 250
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
Convergence of the steepest descent method for minimizing quasiconvex functions
Kiwiel, K. C., & Murty, K. G. (1996) · Journal of Optimization Theory and Applications · doi:10.1007/bf02192649 · Cited by 71
Approximate Solutions of Analytic Inequality Systems
Dedieu, J.-P. (2000) · SIAM Journal on Optimization · doi:10.1137/s105262349935606x · Cited by 11
Cited by
Optimization Algorithms on Matrix Manifolds
Absil, P.-A., Mahony, R., & Sepulchre, R. (2008) · Princeton University Press eBooks · doi:10.1515/9781400830244 · Cited by 1,840
Self-citationAttouch, H., Bolte, J., & Svaiter, B. F. (2013) · Mathematical Programming · doi:10.1007/s10107-011-0484-9 · Cited by 1,414
Attouch, H., Bolte, J., Redont, P., & Soubeyran, A. (2010) · Mathematics of Operations Research · doi:10.1287/moor.1100.0449 · Cited by 1,172
Bolte, J., Daniilidis, A., & Lewis, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050644641 · Cited by 671
From error bounds to the complexity of first-order descent methods for convex functions
Bolte, J., Nguyen, T. P., Peypouquet, J., & Suter, B. W. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1091-6 · Cited by 265
Metadata
- Authors
- Absil, P. A., Mahony, R., & Andrews, B.
- Venue
- SIAM Journal on Optimization
- Published
- 2005-01
- Volume
- 16
- Issue
- 2
- Pages
- 531-547
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2077612096
- Cited by
- 291
- References
- 25
- FWCI
- 5.33
- 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.