The DOI matches its Crossref record.
A modular system of algorithms for unconstrained minimization
Abstract
We describe a new package, UNCMIN, for finding a local minimizer of a real valued function of more than one variable. The novel feature of UNCMIN is that it is a modular system of algorithms, containing three different step selection strategies (line search, dogleg, and optimal step) that may be combined with either analytic or finite difference gradient evaluation and with either analytic, finite difference, or BFGS Hessian approximation. We present the results of a comparison of the three step selection strategies on the problems in More, Garbow, and Hillstrom in two separate cases: using finite difference gradients and Hessians, and using finite difference gradients with BFGS Hessian approximations. We also describe a second package, REVMIN, that uses optimization algorithms identical to UNCMIN but obtains values of user-supplied functions by reverse communication.
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
Comparing Implementations of Estimation Methods for Spatial Econometrics
Bivand, R., & Piras, G. (2015) · Journal of Statistical Software · doi:10.18637/jss.v063.i18 · Cited by 939
Restricted maximum likelihood estimation of covariances in sparse linear models
Neumaier, A., & Groeneveld, E. (1998) · Genetics Selection Evolution · doi:10.1186/1297-9686-30-1-3 · Cited by 428
Unifying Optimization Algorithms to Aid Software System Users:optimx for R
Nash, J. C., & Varadhan, R. (2011) · Journal of Statistical Software · doi:10.18637/jss.v043.i09 · Cited by 426
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
Self-citationCannon, A. J. (2011) · Computers & Geosciences · doi:10.1016/j.cageo.2010.07.005 · Cited by 404
A Stable and Efficient Algorithm for Nonlinear Orthogonal Distance Regression
Boggs, P. T., Byrd, R. H., & Schnabel, R. B. (1987) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0908085 · Cited by 369
Self-citationSung, Y. J., Dawson, G., Munson, J., Estes, A., Schellenberg, G. D., & Wijsman, E. M. (2005) · The American Journal of Human Genetics · doi:10.1086/426951 · Cited by 113
Metadata
- Authors
- Schnabel, R. B., Koonatz, J. E., & Weiss, B. E.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1985-12
- Volume
- 11
- Issue
- 4
- Pages
- 419-440
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W1992976319
- Cited by
- 195
- References
- 0
- FWCI
- 4.12
- 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.