The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Abstract
Algorithms based on trust regions have been shown to be robust methods for unconstrained optimization problems. All existing methods, either based on the dogleg strategy or Hebden-More iterations, require solution of system of linear equations. In large scale optimization this may be prohibitively expensive. It is shown in this paper that an approximate solution of the trust region problem may be found by the preconditioned conjugate gradient method. This may be regarded as a generalized dogleg technique where we asymptotically take the inexact quasi-Newton step. We also show that we have the same convergence properties as existing methods based on the dogleg strategy using an approximate Hessian.
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
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
The Levenberg-Marquardt algorithm: Implementation and theory
Moré, J. J. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067700 · Cited by 5,773
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
Computing Optimal Locally Constrained Steps
Gay, D. M. (1981) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0902016 · Cited by 293
Cited by
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2020) · Nature Methods · doi:10.1038/s41592-019-0686-2 · Cited by 38,430
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2019) · Apollo - University of Cambridge Repository · doi:10.17863/cam.64134 · Cited by 10,460
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
Coleman, T. F., & Li, Y. (1996) · SIAM Journal on Optimization · doi:10.1137/0806023 · Cited by 3,320
Optimization Methods for Large-Scale Machine Learning
Bottou, L., Curtis, F. E., & Nocedal, J. (2018) · SIAM Review · doi:10.1137/16m1080173 · Cited by 3,128
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
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
An Interior Point Algorithm for Large-Scale Nonlinear Programming
Byrd, R. H., Hribar, M. E., & Nocedal, J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497325107 · Cited by 1,739
A trust region method based on interior point techniques for nonlinear programming
Byrd, R. H., Gilbert, J. C., & Nocedal, J. (2000) · Mathematical Programming · doi:10.1007/pl00011391 · Cited by 1,638
Branch, M. A., Coleman, T. F., & Li, Y. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595289108 · Cited by 1,083
An interior algorithm for nonlinear optimization that combines line search and trust region steps
Waltz, R. A., Morales, J. L., Nocedal, J., & Orban, D. (2006) · Mathematical Programming · doi:10.1007/s10107-004-0560-5 · Cited by 1,057
DeMiguel, V., Garlappi, L., Nogales, F. J., & Uppal, R. (2009) · Management Science · doi:10.1287/mnsc.1080.0986 · Cited by 1,038
Conn, A. R., Gould, N. I. M., & Toint, P. (1991) · SIAM Journal on Numerical Analysis · doi:10.1137/0728030 · Cited by 873
Coleman, T. F., & Li, Y. (1996) · SIAM Journal on Optimization · doi:10.1137/s1052623494240456 · Cited by 604
Trust-Region Methods on Riemannian Manifolds
Absil, P.-A., Baker, C. G., & Gallivan, K. A. (2007) · Foundations of Computational Mathematics · doi:10.1007/s10208-005-0179-9 · Cited by 461
Recent Developments in Algorithms and Software for Trust Region Methods
Moré, J. J. (1983) · Mathematical Programming The State of the Art · doi:10.1007/978-3-642-68874-4_11 · Cited by 359
Theory of algorithms for unconstrained optimization
Nocedal, J. (1992) · Acta Numerica · doi:10.1017/s0962492900002270 · Cited by 333
Recent advances in trust region algorithms
Yuan, Y.-X. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0893-2 · Cited by 314
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
Trust region Newton methods for large-scale logistic regression
Lin, C.-J., Weng, R. C., & Keerthi, S. S. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273567 · Cited by 284
SE-Sync: A certifiably correct algorithm for synchronization over the special Euclidean group
Rosen, D. M., Carlone, L., Bandeira, A. S., & Leonard, J. J. (2019) · The International Journal of Robotics Research · doi:10.1177/0278364918784361 · Cited by 282
Solving the Trust-Region Subproblem using the Lanczos Method
Gould, N. I. M., Lucidi, S., Roma, M., & Toint, P. L. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497322735 · Cited by 280
Tomographic absorption spectroscopy for the study of gas dynamics and reactive flows
Cai, W., & Kaminski, C. F. (2017) · Progress in Energy and Combustion Science · doi:10.1016/j.pecs.2016.11.002 · Cited by 280
Sorber, L., Van Barel, M., & De Lathauwer, L. (2013) · SIAM Journal on Optimization · doi:10.1137/120868323 · Cited by 273
Global rates of convergence for nonconvex optimization on manifolds
Boumal, N., Absil, P.-A., & Cartis, C. (2019) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/drx080 · Cited by 271
A survey of truncated-Newton methods
Nash, S. G. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00426-x · Cited by 266
Arboleya, P., Gonzalez-Moran, C., & Coto, M. (2014) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2292112 · Cited by 49
Petridis, S., Blanas, O., Rakopoulos, D., Stergiopoulos, F., Nikolopoulos, N., & Voutetakis, S. (2021) · Energies · doi:10.3390/en14040897 · Cited by 38
Metadata
- Authors
- Steihaug, T.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1983-06
- Volume
- 20
- Issue
- 3
- Pages
- 626-637
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2000389939
- Cited by
- 824
- References
- 4
- FWCI
- 4.01
- 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.