The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
Abstract
This paper extends the known excellent global convergence properties of trust region algorithms for unconstrained optimization to the case where bounds on the variables are present. Weak conditions on the accuracy of the Hessian approximations are considered. It is also shown that, when the strict complementarily condition holds, the proposed algorithms reduce to an unconstrained calculation after finitely many iterations, allowing a fast asymptotic rate of convergence.
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
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
Levary, R. R. (1982) · European Journal of Operational Research · doi:10.1016/0377-2217(82)90093-5 · Cited by 4,158
Constrained Optimization and Lagrange Multiplier Methods
(1982) · Elsevier eBooks · doi:10.1016/c2013-0-10366-2 · Cited by 4,016
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
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
Computing Optimal Locally Constrained Steps
Gay, D. M. (1981) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0902016 · Cited by 293
Testing a class of methods for solving minimization problems with simple bounds on the variables
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1988) · Mathematics of Computation · doi:10.1090/s0025-5718-1988-0929544-3 · Cited by 206
Self-citationVardi, A. (1985) · SIAM Journal on Numerical Analysis · doi:10.1137/0722035 · Cited by 139
Numerical experiments with partially separable optimization problems
Griewank, A., & Toint, P. L. (1984) · Lecture notes in mathematics · doi:10.1007/bfb0099526 · Cited by 43
Self-citation
Cited by
A Limited Memory Algorithm for Bound Constrained Optimization
Byrd, R. H., Lu, P., Nocedal, J., & Zhu, C. (1995) · SIAM Journal on Scientific Computing · doi:10.1137/0916069 · Cited by 6,221
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
Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
Kolda, T. G., Lewis, R. M., & Torczon, V. (2003) · SIAM Review · doi:10.1137/s003614450242889 · Cited by 1,653
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
Birgin, E. G., Martínez, J. M., & Raydan, M. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623497330963 · Cited by 1,056
Metadata
- Authors
- Conn, A. R., Gould, N. I. M., & Toint, P. L.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1988-04
- Volume
- 25
- Issue
- 2
- Pages
- 433-460
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2148589597
- Cited by
- 317
- References
- 9
- FWCI
- 7.41
- 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.