The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Computing a Trust Region Step
Open accessAbstract
We propose an algorithm for the problem of minimizing a quadratic function subject to an ellipsoidal constraint and show that this algorithm is guaranteed to produce a nearly optimal solution in a finite number of iterations. We also consider the use of this algorithm in a trust region Newton’s method. In particular, we prove that under reasonable assumptions the sequence generated by Newton’s method has a limit point which satisfies the first and second order necessary conditions for a minimizer of the objective function. Numerical results for GQTPAR, which is a Fortran implementaton of our algorithm, show that GQTPAR is quite successful in a trust region method. In our tests a call to GQTPAR only required 1.6 iterations on the average.
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
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
The Levenberg-Marquardt algorithm: Implementation and theory
Moré, J. J. (1978) · Lecture Notes in Mathematics · doi:10.1007/bfb0067700 · Cited by 5,773
Self-citationReinsch, C. H. (1967) · Numerische Mathematik · doi:10.1007/bf02162161 · Cited by 2,236
Testing Unconstrained Optimization Software
Morè, J. J., Garbow, B. S., & Hillstrom, K. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355934.355936 · Cited by 1,527
Self-citationPractical Methods of Optimization. Volume 1: Unconstrained Optimization
Williams, T. (1980) · Cited by 697
Newton’s Method with a Model Trust Region Modification
Sorensen, D. C. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719026 · Cited by 560
Self-citationMaximization by Quadratic Hill-Climbing
Goldfeld, S. M., Quandt, R. E., & Trotter, H. F. (1966) · Econometrica · doi:10.2307/1909768 · Cited by 364
Smoothing by spline functions. II
Reinsch, C. H. (1971) · Numerische Mathematik · doi:10.1007/bf02169154 · Cited by 333
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
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
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
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
Branch, M. A., Coleman, T. F., & Li, Y. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595289108 · Cited by 1,083
Space Mapping: The State of the Art
Bandler, J. W., Cheng, Q. S., Dakroury, S. A., Mohamed, A. S., Bakr, M. H., Madsen, K., & Sondergaard, J. (2004) · IEEE Transactions on Microwave Theory and Techniques · doi:10.1109/tmtt.2003.820904 · Cited by 1,064
SBA: A software package for generic sparse bundle adjustment
Lourakis, M. I. A., & Argyros, A. A. (2009) · ACM Transactions on Mathematical Software · doi:10.1145/1486525.1486527 · Cited by 788
Ten simple rules for the computational modeling of behavioral data
Wilson, R. C., & Collins, A. G. (2019) · eLife · doi:10.7554/elife.49547 · Cited by 710
Building Force Fields: An Automatic, Systematic, and Reproducible Approach
Wang, L.-P., Martinez, T. J., & Pande, V. S. (2014) · The Journal of Physical Chemistry Letters · doi:10.1021/jz500737m · Cited by 559
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
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
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
Derivative-free optimization methods
Larson, J., Menickelly, M., & Wild, S. M. (2019) · Acta Numerica · doi:10.1017/s0962492919000060 · Cited by 381
A Stable and Efficient Algorithm for Nonlinear Orthogonal Distance Regression
Boggs, P. T., Byrd, R. H., & Schnabel, R. B. (1987) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0908085 · Cited by 369
Geweke, J., & Amisano, G. (2011) · Journal of Econometrics · doi:10.1016/j.jeconom.2011.02.017 · Cited by 366
A Trust Region Algorithm for Nonlinearly Constrained Optimization
Byrd, R. H., Schnabel, R. B., & Shultz, G. A. (1987) · SIAM Journal on Numerical Analysis · doi:10.1137/0724076 · Cited by 353
On Computational Issues of Market-Based Optimal Power Flow
Wang, H., Murillo-Sanchez, C. E., Zimmerman, R. D., & Thomas, R. J. (2007) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2007.901301 · Cited by 352
UOBYQA: unconstrained optimization by quadratic approximation
Powell, M. J. D. (2002) · Mathematical Programming · doi:10.1007/s101070100290 · Cited by 352
Abdelaziz, M. M. A., Farag, H. E., El-Saadany, E. F., & Mohamed, Y. A.-R. I. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2195785 · Cited by 335
Systematic Improvement of a Classical Molecular Model of Water
Wang, L.-P., Head-Gordon, T., Ponder, J. W., Ren, P., Chodera, J. D., Eastman, P. K., Martinez, T. J., & Pande, V. S. (2013) · The Journal of Physical Chemistry B · doi:10.1021/jp403802c · Cited by 330
Algorithm 611: Subroutines for Unconstrained Minimization Using a Model/Trust-Region Approach
Gay, D. M. (1983) · ACM Transactions on Mathematical Software · doi:10.1145/356056.356066 · Cited by 322
Damage detection by finite element model updating using modal flexibility residual
Jaishi, B., & Ren, W.-X. (2006) · Journal of Sound and Vibration · doi:10.1016/j.jsv.2005.04.006 · Cited by 320
Björck, Å. (1990) · Handbook of Numerical Analysis · doi:10.1016/s1570-8659(05)80036-5 · Cited by 313
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
Retrieval algorithms for the EOS Microwave limb sounder (MLS)
Livesey, N. J., Van Snyder, W., Read, W. G., & Wagner, P. A. (2006) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2006.872327 · Cited by 281
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
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
Chong, L., Zhang, G., Goucher-Lambert, K., Kotovsky, K., & Cagan, J. (2022) · Computers in Human Behavior · doi:10.1016/j.chb.2021.107018 · Cited by 262
Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
Sun, J., Qu, Q., & Wright, J. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2632162 · Cited by 213
Ebel, B. A., Rengers, F. K., & Tucker, G. E. (2016) · Water Resources Research · doi:10.1002/2016wr019110 · Cited by 64
Metadata
- Authors
- Moré, J. J., & Sorensen, D. C.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1983-09
- Volume
- 4
- Issue
- 3
- Pages
- 553-572
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2075184363
- Cited by
- 1,411
- References
- 9
- FWCI
- 5.01
- Type
- journal article
- Language
- en
- Open access
- green
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.