The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
Abstract
In this paper, we seek the conjugate gradient direction closest to the direction of the scaled memoryless BFGS method and propose a family of conjugate gradient methods for unconstrained optimization. An improved Wolfe line search is also proposed, which can avoid a numerical drawback of the original Wolfe line search and guarantee the global convergence of the conjugate gradient method under mild conditions. To accelerate the algorithm, we introduce adaptive restarts along negative gradients based on the extent to which the function approximates some quadratic function during previous iterations. Numerical experiments with the CUTEr collection show that the proposed algorithm is promising.
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
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
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Function minimization by conjugate gradients
Fletcher, R. (1964) · The Computer Journal · doi:10.1093/comjnl/7.2.149 · Cited by 4,939
Benchmarking optimization software with performance profiles
Dolan, E. D., & Moré, J. J. (2002) · Mathematical Programming · doi:10.1007/s101070100263 · Cited by 4,412
Restart procedures for the conjugate gradient method
Powell, M. J. D. (1977) · Mathematical Programming · doi:10.1007/bf01593790 · Cited by 1,717
Testing Unconstrained Optimization Software
Morè, J. J., Garbow, B. S., & Hillstrom, K. E. (1981) · ACM Transactions on Mathematical Software · doi:10.1145/355934.355936 · Cited by 1,527
A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
Dai, Y. H., & Yuan, Y. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623497318992 · Cited by 1,378
Self-citationThe conjugate gradient method in extremal problems
Polyak, B. T. (1969) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(69)90035-4 · Cited by 1,164
Convergence Conditions for Ascent Methods
Wolfe, P. (1969) · SIAM Review · doi:10.1137/1011036 · Cited by 1,106
Note sur la convergence de méthodes de directions conjuguées
Polak, E., & Ribiere, G. (1969) · Revue française d'informatique et de recherche opérationnelle. Série rouge · doi:10.1051/m2an/196903r100351 · Cited by 986
A SURVEY OF NONLINEAR CONJUGATE GRADIENT METHODS
Hager, W. W., & Zhang, H. (2005) · Cited by 779
Practical Methods of Optimization. Volume 1: Unconstrained Optimization
Williams, T. (1980) · Cited by 697
Gould, N. I. M., Orban, D., & Toint, P. L. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/962437.962439 · Cited by 584
Convergence Conditions for Ascent Methods. II: Some Corrections
Wolfe, P. (1971) · SIAM Review · doi:10.1137/1013035 · Cited by 569
Wiley Encyclopedia of Operations Research and Management Science
Cochran, J. J., Cox, L. A., Keskinocak, P., Kharoufeh, J. P., & Smith, J. C. (2011) · Wiley eBooks · doi:10.1002/9780470400531 · Cited by 545
Zhang, L., Zhou, W., & Li, D. (2006) · Numerische Mathematik · doi:10.1007/s00211-006-0028-z · Cited by 292
An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimization
Dai, Y. H., & Yuan, Y. (2001) · Annals of Operations Research · doi:10.1023/a:1012930416777 · Cited by 252
Self-citationRemark 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
Nonlinear Conjugate Gradient Methods
Dai, Y. (2011) · Wiley Encyclopedia of Operations Research and Management Science · doi:10.1002/9780470400531.eorms0183 · Cited by 225
Self-citationPractical Methods of Optimization, Vol. 1: Unconstrained Optimization (R. Fletcher)
Dennis, J. E. (1982) · SIAM Review · doi:10.1137/1024028 · Cited by 63
A family of hybrid conjugate gradient methods for unconstrained optimization
Dai, Y. (2003) · Mathematics of Computation · doi:10.1090/s0025-5718-03-01491-1 · Cited by 31
Self-citation
Cited by
Fan, Q., Zhang, Z., & Huang, X. (2022) · Advanced Theory and Simulations · doi:10.1002/adts.202200047 · Cited by 41
Metadata
- Authors
- Dai, Y.-H., & Kou, C.-X.
- Venue
- SIAM Journal on Optimization
- Published
- 2013-01
- Volume
- 23
- Issue
- 1
- Pages
- 296-320
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2075313995
- Cited by
- 308
- References
- 23
- FWCI
- 23.24
- 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.