The DOI matches its Crossref record.
User's Guide for NPSOL (Version 4.0): A Fortran Package for Nonlinear Programming.
Abstract
This report forms the user's guide for Version 4.0 of NPSOL, a set of Fortran subroutines designed to minimize a smooth function subject to constraints, which may include simple bounds on the variables, linear constraints and smooth nonlinear constraints. (NPSOL may also be used for unconstrained, bound-constrained and linearly constrained optimization.) The user must provide subroutines that define the objective and constraint functions and (optionally) their gradients. All matrices are treated as dense, and hence NPSOL is not intended for large sparse problems. NPSOL uses a sequential quadratic programming (SQP) algorithm, in which the search directions is the solution of a quadratic programming (QP) subproblem. The algorithm treats bounds, linear constraints and nonlinear constraints separately. The Hessian of each QP subproblem is a positive-definite quasi-Newton approximation to the Hessian of the Lagrangian function. The steplength at each iteration is required to produce a sufficient decrease an augmented Lagrangian merit function. Each QP subproblem is solved using a quadratic programming package with several features that improve the efficiency of an SQP algorithm. (Author)
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
Survey of Numerical Methods for Trajectory Optimization
Betts, J. T. (1998) · Journal of Guidance, Control, and Dynamics · doi:10.2514/2.4231 · Cited by 2,602
Sequential quadratic programming
Boggs, P. T., & Tolle, J. W. (1995) · Acta Numerica · doi:10.1017/s0962492900002518 · Cited by 1,858
“This form has been further developed and incorporated into a highly successful algorithm by Gill et al. (1986).”
MethodBayesian Experimental Design: A Review
Chaloner, K., & Verdinelli, I. (1995) · Statistical Science · doi:10.1214/ss/1177009939 · Cited by 1,839
SNOPT: 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
Self-citationOpenMx 2.0: Extended Structural Equation and Statistical Modeling
Neale, M. C., Hunter, M. D., Pritikin, J. N., Zahery, M., Brick, T. R., Kirkpatrick, R. M., Estabrook, R., Bates, T. C., Maes, H. H., & Boker, S. M. (2016) · Psychometrika · doi:10.1007/s11336-014-9435-8 · Cited by 1,100
An Introduction to the Adjoint Approach to Design
Giles, M. B., & Pierce, N. A. (2000) · Flow, Turbulence and Combustion · doi:10.1023/a:1011430410075 · Cited by 989
Semi-Nonparametric Maximum Likelihood Estimation
Gallant, A. R., & Nychka, D. W. (1987) · Econometrica · doi:10.2307/1913241 · Cited by 913
Constrained Monte Carlo Maximum Likelihood for Dependent Data
Geyer, C. J., & Thompson, E. A. (1992) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1992.tb01443.x · Cited by 874
Eldred, M., Dalbey, K., Bohnhoff, W., Adams, B., Swiler, L., Hough, P., Gay, D., Eddy, J., & Haskell, K. (2010) · doi:10.2172/991842 · Cited by 776
Optimal design of a CMOS op-amp via geometric programming
Hershenson, M. D., Boyd, S. P., & Lee, T. H. (2001) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.905671 · Cited by 548
Rogers, L. L., & Dowla, F. U. (1994) · Water Resources Research · doi:10.1029/93wr01494 · Cited by 486
Efficient estimation for the proportional hazards model with interval censoring
Huang, J. (1996) · The Annals of Statistics · doi:10.1214/aos/1032894452 · Cited by 448
Gallant, A. R., & Tauchen, G. (1989) · Econometrica · doi:10.2307/1913624 · Cited by 440
Koehler, J. R., & Owen, A. B. (1996) · Handbook of Statistics · doi:10.1016/s0169-7161(96)13011-x · Cited by 322
Finding Chaos in Noisy Systems
Nychka, D., Ellner, S., Gallant, A. R., & McCaffrey, D. (1992) · Journal of the Royal Statistical Society: Series B (Methodological) · doi:10.1111/j.2517-6161.1992.tb01889.x · Cited by 305
Metadata
- Authors
- Gill, P. E., Murray, W., Saunders, M. A., & Wright, M. H.
- Publisher
- Defense Technical Information Center
- Published
- 1986-01-01
- OpenAlex
- W2083940610
- Cited by
- 523
- References
- 0
- Type
- report
- 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.