The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Quasi-Newton Methods for Unconstrained Optimization
Abstract
A revised algorithm is given for unconstrained optimization using quasi-Newton methods. The method is based on recurring the factorization of an approximation to the Hessian matrix. Knowledge of this factorization allows greater flexibility when choosing the direction of search while minimizing the adverse effects of rounding error. The control of rounding error is particularly important when analytical derivatives are unavailable, and a modification of the algorithm to accept finite-difference approximations to the derivatives is given.
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
Iterative Solution of Nonlinear Equations in Several Variables
Ortega, J. M., & Rheinboldt, W. C. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719468 · Cited by 6,860
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
Minimization of functions having Lipschitz continuous first partial derivatives
Armijo, L. (1966) · Pacific Journal of Mathematics · doi:10.2140/pjm.1966.16.1 · Cited by 1,983
Convergence Conditions for Ascent Methods
Wolfe, P. (1969) · SIAM Review · doi:10.1137/1011036 · Cited by 1,106
Cited by
Iterative methods for linear and nonlinear equations
(1996) · Choice Reviews Online · doi:10.5860/choice.33-4556 · Cited by 1,947
Quasi-Newton Methods, Motivation and Theory
Dennis, Jr., & Moré, J. J. (1977) · SIAM Review · doi:10.1137/1019005 · Cited by 1,553
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
Green, P. J. (1984) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1984.tb01288.x · Cited by 687
Methods for modifying matrix factorizations
Gill, P. E., Golub, G. H., Murray, W., & Saunders, M. A. (1974) · Mathematics of Computation · doi:10.1090/s0025-5718-1974-0343558-6 · Cited by 590
Self-citationRegression and ordered categorical variables
Anderson, J. A. (1984) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1984.tb01270.x · Cited by 574
Optimization Concepts and Applications in Engineering
Belegundu, A. D., & Chandrupatla, T. R. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511975905 · Cited by 555
Principles of optimal design-modeling and computation
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90173-0 · Cited by 544
Large-scale linearly constrained optimization
Murtagh, B. A., & Saunders, M. A. (1978) · Mathematical Programming · doi:10.1007/bf01588950 · Cited by 527
Jacquemoud, S., Baret, F., Andrieu, B., Danson, F. M., & Jaggard, K. (1995) · Remote Sensing of Environment · doi:10.1016/0034-4257(95)00018-v · Cited by 423
Hybrid methods using genetic algorithms for global optimization
Renders, J.-M., & Flasse, S. P. (1996) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.485836 · Cited by 409
Integrated driving behavior modeling
Toledo, T., Koutsopoulos, H. N., & Ben-Akiva, M. (2007) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2007.02.002 · Cited by 388
Failure forecast for large rock slides by surface displacement measurements
Crosta, G. B., & Agliardi, F. (2003) · Canadian Geotechnical Journal · doi:10.1139/t02-085 · Cited by 340
Newton-type methods for unconstrained and linearly constrained optimization
Gill, P. E., & Murray, W. (1974) · Mathematical Programming · doi:10.1007/bf01585529 · Cited by 335
Self-citationLimbMotion: Decimeter-level Limb Tracking for Wearable-based Human-Computer Interaction
Zhou, H., Gao, Y., Song, X., Liu, W., & Dong, W. (2019) · Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies · doi:10.1145/3369836 · Cited by 27
Metadata
- Authors
- GILL, P. E., & MURRAY, W.
- Venue
- IMA Journal of Applied Mathematics
- Publisher
- Oxford University Press (OUP)
- Published
- 1972
- Volume
- 9
- Issue
- 1
- Pages
- 91-108
- ISSN
- 0272-4960 (ISSN-L)
- 1464-3634
- OpenAlex
- W2145126461
- Cited by
- 359
- References
- 4
- FWCI
- 7.43
- 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.