The DOI matches its Crossref record.
A Reduced Hessian Method for Large-Scale Constrained Optimization
Open accessAbstract
We propose a quasi-Newton algorithm for solving large optimization problems with nonlinear equality constraints. It is designed for problems with few degrees of freedom and is motivated by the need to use sparse matrix factorizations. The algorithm incorporates a correction vector that approximates the cross term $Z^T WY{p_Y} $ in order to estimate the curvature in both the range and null spaces of the constraints. The algorithm can be considered to be, in some sense, a practical implementation of an algorithm of Coleman and Conn. We give conditions under which local and superlinear convergence is obtained.
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
Cited by
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2005) · SIAM Review · doi:10.1137/s0036144504446096 · Cited by 2,834
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-citationSNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Gill, P. E., Murray, W., & Saunders, M. A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499350013 · Cited by 1,587
Representations of quasi-Newton matrices and their use in limited memory methods
Byrd, R. H., Nocedal, J., & Schnabel, R. B. (1994) · Mathematical Programming · doi:10.1007/bf01582063 · Cited by 744
Self-citationExploring potential energy surfaces for chemical reactions: An overview of some practical methods
Schlegel, H. B. (2003) · Journal of Computational Chemistry · doi:10.1002/jcc.10231 · Cited by 395
Schlegel, H. B. (2011) · WIREs Computational Molecular Science · doi:10.1002/wcms.34 · Cited by 360
Sequential quadratic programming for large-scale nonlinear optimization
Boggs, P. T., & Tolle, J. W. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00429-5 · Cited by 283
Biros, G., & Ghattas, O. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/s106482750241565x · Cited by 269
A framework for automated PDE-constrained optimisation
Funke, S. W., & Farrell, P. E. (2013) · arXiv · doi:10.48550/arxiv.1302.3894 · Cited by 58
Metadata
- Authors
- Biegler, L. T., Nocedal, J., & Schmid, C.
- Venue
- SIAM Journal on Optimization
- Published
- 1995-05
- Volume
- 5
- Issue
- 2
- Pages
- 314-347
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2165622925
- Cited by
- 160
- References
- 0
- FWCI
- 13.20
- 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.