The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Newton-type methods for unconstrained and linearly constrained optimization
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
I., E., Ortega, J. M., & Rheinboldt, W. C. (1971) · Mathematics of Computation · doi:10.2307/2004942 · Cited by 4,408
Nonlinear Programming: Sequential Unconstrained Minimization Techniques
Fiacco, A. V., & McCormick, G. P. (1968) · Defense Technical Information Center (DTIC) · Cited by 2,262
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
Powell, M. J. D. (1969) · The Computer Journal · doi:10.1093/comjnl/12.3.207-a · Cited by 1,757
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-citationNumerical Methods for Unconstrained Optimization
G., D., & Murray, W. (1975) · Mathematics of Computation · doi:10.2307/2005592 · Cited by 571
Self-citationMethods of Feasible Directions
Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (2005) · doi:10.1002/0471787779.ch10 · Cited by 541
Linear least squares solutions by householder transformations
Businger, P., & Golub, G. H. (1965) · Numerische Mathematik · doi:10.1007/bf01436084 · Cited by 508
Brown, K. M., & Dennis, J. E. (1971) · Numerische Mathematik · doi:10.1007/bf01404679 · Cited by 370
Quasi-Newton Methods for Unconstrained Optimization
GILL, P. E., & MURRAY, W. (1972) · IMA Journal of Applied Mathematics · doi:10.1093/imamat/9.1.91 · Cited by 359
Self-citationNumerical Techniques in Mathematical Programming
Bartels, R. H., Golub, G. H., & Saunders, M. A. (1970) · Elsevier eBooks · doi:10.1016/b978-0-12-597050-1.50009-9 · Cited by 66
Cited by
Iterative Methods for Optimization
Kelley, C. T. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970920 · Cited by 2,052
Newton’s Method with a Model Trust Region Modification
Sorensen, D. C. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719026 · Cited by 560
Support Vector Machines for Classification
Awad, M., & Khanna, R. (2015) · Efficient Learning Machines · doi:10.1007/978-1-4302-5990-9_3 · Cited by 543
Large-scale linearly constrained optimization
Murtagh, B. A., & Saunders, M. A. (1978) · Mathematical Programming · doi:10.1007/bf01588950 · Cited by 527
Perturbative approach to Markovian open quantum systems
Li, A. C. Y., Petruccione, F., & Koch, J. (2014) · Scientific Reports · doi:10.1038/srep04887 · Cited by 110
Metadata
- Authors
- Gill, P. E., & Murray, W.
- Venue
- Mathematical Programming
- Published
- 1974-12
- Volume
- 7
- Issue
- 1
- Pages
- 311-350
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1976222070
- Cited by
- 335
- References
- 10
- FWCI
- 2.99
- 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.
