The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Line search algorithms with guaranteed sufficient decrease
Open accessAbstract
The development of software for minimization problems is often based on a line search method. We consider line search methods that satisfy sufficient decrease and curvature conditions, and formulate the problem of determining a point that satisfies these two conditions in terms of finding a point in a set T(μ) . We describe a search algorithm for this problem that produces a sequence of iterates that converge to a point in T(μ) and that, except for pathological cases, terminates in a finite number of steps. Numerical results for an implementation of the search algorithm on a set of test functions show that the algorithm terminates within a small number of iterations.
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
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
Byrd, R. H., Nocedal, J., & Yuan, Y.-X. (1987) · SIAM Journal on Numerical Analysis · doi:10.1137/0724077 · Cited by 319
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
Robust Regression Computation Using Iteratively Reweighted Least Squares
O’Leary, D. P. (1990) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0611032 · Cited by 166
TNPACK—A truncated Newton minimization package for large-scale problems
Schlick, T., & Fogelson, A. L. (1992) · ACM Transactions on Mathematical Software · doi:10.1145/128745.150973 · Cited by 117
TNPACK—a truncated Newton minimization package for large-scale problems
Tamar Schlick, A., & Fogelson, A. L. (1992) · ACM Transactions on Mathematical Software · doi:10.1145/128745.150975 · Cited by 49
Cited by
Block-iterative frequency-domain methods for Maxwell's equations in a planewave basis
Johnson, S., & Joannopoulos, J. (2001) · Optics Express · doi:10.1364/oe.8.000173 · Cited by 3,217
Deformable medical image registration: a survey
Sotiras, A., Davatzikos, C., & Paragios, N. (2013) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2013.2265603 · Cited by 1,587
“The rst employed a function of the step size that decayed with each iteration, while the second was based on the inexact line search algorithm of Moré and Thuente [372].”
MethodA feasible method for optimization with orthogonality constraints
Wen, Z., & Yin, W. (2013) · Mathematical Programming · doi:10.1007/s10107-012-0584-1 · Cited by 849
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
Interior Methods for Nonlinear Optimization
Forsgren, A., Gill, P. E., & Wright, M. H. (2002) · SIAM Review · doi:10.1137/s0036144502414942 · Cited by 699
Metadata
- Authors
- Moré, J. J., & Thuente, D. J.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1994-09
- Volume
- 20
- Issue
- 3
- Pages
- 286-307
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2091917610
- Cited by
- 528
- References
- 7
- FWCI
- 5.72
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Line search algorithms with guaranteed sufficient decrease. https://app.cochat.ai/papers/10.1145/192115.192132
- The paper
- Moré, J. J., & Thuente, D. J. (1994). Line search algorithms with guaranteed sufficient decrease. ACM Transactions on Mathematical Software. https://doi.org/10.1145/192115.192132
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.