×

New conjugate gradient-like methods for unconstrained optimization. (English) Zbl 1308.65090

The authors present two new general forms of conjugate gradient (CG) methods for unconstrained optimization. Compared with other existing CG methods, the descent and the global convergence properties of the proposed new CG-like methods are guaranteed independent of the choices of the update formulas and line search used under some suitable and appropriate conditions.

MSC:

65K05 Numerical mathematical programming methods
90C30 Nonlinear programming

Software:

CG_DESCENT
Full Text: DOI

References:

[1] DOI: 10.1093/imanum/5.1.121 · Zbl 0578.65063 · doi:10.1093/imanum/5.1.121
[2] T.M. Apostol,Mathematical Analysis, 2nd ed., Addison-Wesley Publishing Company, Menlo Park, CA, 1974.
[3] DOI: 10.1093/imanum/8.1.141 · Zbl 0638.65055 · doi:10.1093/imanum/8.1.141
[4] DOI: 10.1145/962437.962439 · Zbl 1068.90526 · doi:10.1145/962437.962439
[5] DOI: 10.1080/01630560701749524 · Zbl 1138.90028 · doi:10.1080/01630560701749524
[6] DOI: 10.1007/BF00930579 · Zbl 0172.19002 · doi:10.1007/BF00930579
[7] DOI: 10.1007/s002450010019 · Zbl 0973.65050 · doi:10.1007/s002450010019
[8] DOI: 10.1093/imanum/16.2.155 · Zbl 0851.65049 · doi:10.1093/imanum/16.2.155
[9] Dai Y.H., J. Comput. Math 2 pp 142– (1996)
[10] Y.H. Dai and Y. Yuan,Nonlinear Conjugate Gradient Methods, Shanghai Science and Technology Publisher, Shanghai, 2000.
[11] DOI: 10.1007/s101070100263 · Zbl 1049.90004 · doi:10.1007/s101070100263
[12] DOI: 10.1093/comjnl/7.2.149 · Zbl 0132.11701 · doi:10.1093/comjnl/7.2.149
[13] DOI: 10.1137/0802003 · Zbl 0767.90082 · doi:10.1137/0802003
[14] DOI: 10.1137/030601880 · Zbl 1093.90085 · doi:10.1137/030601880
[15] DOI: 10.1145/1132973.1132979 · Zbl 1346.90816 · doi:10.1145/1132973.1132979
[16] W.W. Hager and H. Zhang,CG-DESCENT Version 1.4 User’ Guide, University of Florida, November 2005. Available at http://www.math.ufl.edu/ hager/papers/CG
[17] DOI: 10.1007/BF00939927 · Zbl 0794.90063 · doi:10.1007/BF00939927
[18] DOI: 10.1007/BF02663897 · Zbl 0834.90122 · doi:10.1007/BF02663897
[19] DOI: 10.1007/BF00929359 · Zbl 0165.22702 · doi:10.1007/BF00929359
[20] DOI: 10.1007/s10589-006-8719-z · Zbl 1128.90059 · doi:10.1007/s10589-006-8719-z
[21] DOI: 10.1137/080743573 · Zbl 1250.90087 · doi:10.1137/080743573
[22] Polak E., Rev. Française Informat. Recherche Opérationnelle 3 pp 35– (1969)
[23] DOI: 10.1016/j.cam.2003.10.025 · Zbl 1050.65061 · doi:10.1016/j.cam.2003.10.025
[24] DOI: 10.1007/s11075-011-9515-0 · Zbl 1245.65069 · doi:10.1007/s11075-011-9515-0
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.