The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
Abstract
We study the global convergence properties of the restricted Broyden class of quasi-Newton methods, when applied to a convex objective function. We assume that the line search satisfies a standard sufficient decrease condition and that the initial Hessian approximation is any positive definite matrix. We show global and superlinear convergence for this class of methods, except for DFP. This generalizes Powell’s well-known result for the BFGS method. The analysis gives us insight into the properties of these algorithms; in particular it shows that DFP lacks a very desirable self-correcting property possessed by BFGS.
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
Quasi-Newton Methods, Motivation and Theory
Dennis, Jr., & Moré, J. J. (1977) · SIAM Review · doi:10.1137/1019005 · Cited by 1,553
Convergence Conditions for Ascent Methods
Wolfe, P. (1969) · SIAM Review · doi:10.1137/1011036 · Cited by 1,106
Convergence Conditions for Ascent Methods. II: Some Corrections
Wolfe, P. (1971) · SIAM Review · doi:10.1137/1013035 · Cited by 569
How bad are the BFGS and DFP methods when the objective function is quadratic?
Powell, M. J. D. (1986) · Mathematical Programming · doi:10.1007/bf01582161 · Cited by 97
Cited by
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
Deformable medical image registration: a survey
Sotiras, A., Davatzikos, C., & Paragios, N. (2013) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2013.2265603 · Cited by 1,587
Some numerical experiments with variable-storage quasi-Newton algorithms
Gilbert, J. C., & Lemaréchal, C. (1989) · Mathematical Programming · doi:10.1007/bf01589113 · Cited by 759
Line search algorithms with guaranteed sufficient decrease
Moré, J. J., & Thuente, D. J. (1994) · ACM Transactions on Mathematical Software · doi:10.1145/192115.192132 · Cited by 528
Nonsmooth optimization via quasi-Newton methods
Lewis, A. S., & Overton, M. L. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0514-2 · Cited by 352
Metadata
- Authors
- Byrd, R. H., Nocedal, J., & Yuan, Y.-X.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1987-10
- Volume
- 24
- Issue
- 5
- Pages
- 1171-1190
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2045968916
- Cited by
- 319
- References
- 4
- FWCI
- 4.59
- 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.