The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
Abstract
We propose a new trust region approach for minimizing a nonlinear function subject to simple bounds. Unlike most existing methods, our proposed method does not require that a quadratic programming subproblem, with inequality constraints, be solved in each iteration. Instead, a solution to a trust region subproblem is defined by minimizing a quadratic function subject only to an ellipsoidal constraint. The iterates generated are strictly feasible. Our proposed method reduces to a standard trust region approach for the unconstrained problem when there are no upper or lower bounds on the variables. Global and local quadratic convergence is established. Preliminary numerical experiments are reported indicating the practical viability of this approach.
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
Moré, J. J., & Sorensen, D. C. (1983) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0904038 · Cited by 1,411
Coleman, T. F., & Li, Y. (1994) · Mathematical Programming · doi:10.1007/bf01582221 · Cited by 1,135
Self-citationThe 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
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
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
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
Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
Conn, A. R., Gould, N. I. M., & Toint, P. L. (1988) · SIAM Journal on Numerical Analysis · doi:10.1137/0725029 · Cited by 317
Computing Optimal Locally Constrained Steps
Gay, D. M. (1981) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0902016 · Cited by 293
Algorithms for bound constrained quadratic programming problems
Mor�, J. J., & Toraldo, G. (1989) · Numerische Mathematik · doi:10.1007/bf01396045 · Cited by 230
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
A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
O’Leary, D. P. (1980) · Linear Algebra and its Applications · doi:10.1016/0024-3795(80)90173-1 · Cited by 89
A direct active set algorithm for large sparse quadratic programs with simple bounds
Coleman, T. F., & Hulbert, L. A. (1989) · Mathematical Programming · doi:10.1007/bf01589112 · Cited by 75
Self-citationA class of methods for solving large, convex quadratic programs subject to box constraints
Yang, E. K., & Tolle, J. W. (1991) · Mathematical Programming · doi:10.1007/bf01586934 · Cited by 62
Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds
Fletcher, R., & JACKSON, M. P. (1974) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/14.2.159 · Cited by 51
A direct method for sparse least squares problems with lower and upper bounds
Bj�rck, �. (1988) · Numerische Mathematik · doi:10.1007/bf01403888 · Cited by 47
A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
Coleman, T. F., & Hulbert, L. A. (1993) · SIAM Journal on Optimization · doi:10.1137/0803014 · Cited by 34
Self-citation
Cited by
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
Self-citationMolecular code for transmembrane-helix recognition by the Sec61 translocon.
Hessa, T., Meindl-Beinker, N. M., Bernsel, A., Kim, H., Sato, Y., Lerch-Bader, M., Nilsson, I., White, S. H., & von Heijne, G. (2007) · Nature · doi:10.1038/nature06387 · Cited by 708
iTUG, a Sensitive and Reliable Measure of Mobility
Salarian, A., Horak, F. B., Zampieri, C., Carlson-Kuhta, P., Nutt, J. G., & Aminian, K. (2010) · IEEE Transactions on Neural Systems and Rehabilitation Engineering · doi:10.1109/tnsre.2010.2047606 · Cited by 489
Metadata
- Authors
- Coleman, T. F., & Li, Y.
- Venue
- SIAM Journal on Optimization
- Published
- 1996-05
- Volume
- 6
- Issue
- 2
- Pages
- 418-445
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2071467620
- Cited by
- 3,320
- References
- 16
- FWCI
- 9.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.