The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Truncated-Newton algorithms for large-scale unconstrained 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
Methods of conjugate gradients for solving linear systems
Hestenes, M. R., & Stiefel, E. (1952) · Journal of Research of the National Bureau of Standards · doi:10.6028/jres.049.044 · Cited by 8,132
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
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
Updating quasi-Newton matrices with limited storage
Nocedal, J. (1980) · Mathematics of Computation · doi:10.1090/s0025-5718-1980-0572855-7 · Cited by 2,958
Gill, P. E., Murray, W., & Wright, M. H. (2019) · doi:10.1137/1.9781611975604 · Cited by 1,737
Quasi-Newton Methods, Motivation and Theory
Dennis, Jr., & Moré, J. J. (1977) · SIAM Review · doi:10.1137/1019005 · Cited by 1,553
Dembo, R. S., Eisenstat, S. C., & Steihaug, T. (1982) · SIAM Journal on Numerical Analysis · doi:10.1137/0719025 · Cited by 1,539
Self-citationConjugate gradient methods for indefinite systems
Fletcher, R. (1976) · Lecture notes in mathematics · doi:10.1007/bfb0080116 · Cited by 802
Large-scale linearly constrained optimization
Murtagh, B. A., & Saunders, M. A. (1978) · Mathematical Programming · doi:10.1007/bf01588950 · Cited by 527
Remark on “Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]”
Shanno, D. F., & Phua, K. H. (1980) · ACM Transactions on Mathematical Software · doi:10.1145/355921.355933 · Cited by 245
A scaled reduced gradient algorithm for network flow problems with convex separable costs
Dembo, R. S., & Klincewicz, J. G. (1981) · Mathematical programming studies · doi:10.1007/bfb0120941 · Cited by 68
Self-citation
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
Tinker 8: Software Tools for Molecular Design
Rackers, J. A., Wang, Z., Lu, C., Laury, M. L., Lagardère, L., Schnieders, M. J., Piquemal, J.-P., Ren, P., & Ponder, J. W. (2018) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.8b00529 · Cited by 1,186
An efficient newton‐like method for molecular mechanics energy minimization of large molecules
Ponder, J. W., & Richards, F. M. (1987) · Journal of Computational Chemistry · doi:10.1002/jcc.540080710 · Cited by 880
Choosing the Forcing Terms in an Inexact Newton Method
Eisenstat, S. C., & Walker, H. F. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917003 · Cited by 736
EGO-Planner: An ESDF-Free Gradient-Based Local Planner for Quadrotors
Zhou, X., Wang, Z., Ye, H., Xu, C., & Gao, F. (2021) · IEEE Robotics and Automation Letters · doi:10.1109/lra.2020.3047728 · Cited by 547
Metadata
- Authors
- Dembo, R. S., & Steihaug, T.
- Venue
- Mathematical Programming
- Published
- 1983-06
- Volume
- 26
- Issue
- 2
- Pages
- 190-212
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1994722534
- Cited by
- 420
- References
- 11
- FWCI
- 7.01
- 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.