The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A Trust Region Algorithm for Nonlinearly Constrained Optimization
Abstract
We present a trust region-based method for the general nonlinearly equality constrained optimization problem. The method works by iteratively minimizing a quadratic model of the Lagrangian subject to a possibly relaxed linearization of the problem constraints and a trust region constraint. The model minimization may be done approximately with a dogleg-type approach. We show that this method is globally convergent even if singular or indefinite Hessian approximations are made. A second order correction step that brings the iterates closer to the feasible set is described. If sufficiently precise Hessian information is used, this correction step allows us to prove that the method is also locally quadratically convergent, and that the limit satisfies the second order necessary conditions for constrained optimization. An example is given to show that, without this correction, a situation similar to the Maratos effect may occur where the iteration is unable to move away from a saddle point.
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
Moré, J. J., & Sorensen, D. C. (1983) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0904038 · Cited by 1,411
A globally convergent method for nonlinear programming
Han, S. P. (1977) · Journal of Optimization Theory and Applications · doi:10.1007/bf00932858 · Cited by 1,097
The watchdog technique for forcing convergence in algorithms for constrained optimization
Chamberlain, R. M., Powell, M. J. D., Lemarechal, C., & Pedersen, H. C. (1982) · Mathematical Programming Studies · doi:10.1007/bfb0120945 · Cited by 313
Vardi, A. (1985) · SIAM Journal on Numerical Analysis · doi:10.1137/0722035 · Cited by 139
Cited by
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
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
Self-citationA 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
Self-citationModeling Soil Processes: Review, Key Challenges, and New Perspectives
Vereecken, H., Schnepf, A., Hopmans, J. W., Javaux, M., Or, D., Roose, T., Vanderborght, J., Young, M. H., Amelung, W., Aitkenhead, M., et al. (2016) · Vadose Zone Journal · doi:10.2136/vzj2015.09.0131 · Cited by 833
Shan, S., & Wang, G. G. (2010) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-009-0420-2 · Cited by 597
Rietveld analysis software for J-PARC
Oishi, R., Yonemura, M., Nishimaki, Y., Torii, S., Hoshikawa, A., Ishigaki, T., Morishima, T., Mori, K., & Kamiyama, T. (2009) · Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment · doi:10.1016/j.nima.2008.11.056 · Cited by 569
Principles of optimal design-modeling and computation
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90173-0 · Cited by 544
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
Recent advances in trust region algorithms
Yuan, Y.-X. (2015) · Mathematical Programming · doi:10.1007/s10107-015-0893-2 · Cited by 314
Evolutionary Game Theory and Social Learning Can Determine How Vaccine Scares Unfold
Bauch, C. T., & Bhattacharyya, S. (2012) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002452 · Cited by 252
Metadata
- Authors
- Byrd, R. H., Schnabel, R. B., & Shultz, G. A.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 1987-10
- Volume
- 24
- Issue
- 5
- Pages
- 1152-1170
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W2038904236
- Cited by
- 353
- References
- 4
- FWCI
- 3.06
- 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.