×

Two modified DY conjugate gradient methods for unconstrained optimization problems. (English) Zbl 1433.90190

Summary: In this paper, we study the unconstrained optimization problems, and the two modified DY conjugate gradient methods (DDY1 method and DDY2 method) are proposed under the DY conjugate gradient method. By using the standard Wolfe line search, we prove the global convergence of the two methods. The search direction of DDY1 method is descent with the standard Wolfe line search. The search direction generated by the DDY2 method is sufficient descent, in which the property does not depend on any line search. 9999inary numerical results show that the two methods are effective.

MSC:

90C52 Methods of reduced gradient type
65K10 Numerical optimization and variational techniques
90C30 Nonlinear programming
65K05 Numerical mathematical programming methods
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Polak, E.; Ribière, G., Note sur la convergence de mèthodes de directions conjugèes, Rev. Française Informat Recherche Opêrationelle, 3, 16, 35-43 (1969) · Zbl 0174.48001
[2] Polyak, B. T., The conjugate gradient method in extreme problems, U. S.S.R. Comput. Math. and Math. Phys., 9, 94-112 (1969) · Zbl 0229.49023
[3] Hestenes, M. R.; Stiefel, E., Method of conjugate gradient for solving linear equations, J. Res. Nat. Bur. Standards., 49, 409-436 (1952) · Zbl 0048.09901
[4] Fletcher, R.; Reeves, C. M., Function minimization by conjugate gradients, Comput. J., 7, 149-154 (1964) · Zbl 0132.11701
[5] Dai, Y. H.; Yuan, Y. X., A nonlinear conjugate gradient method with a strong global convergence property, SIAM J. Optim., 10, 1, 177-182 (1999) · Zbl 0957.65061
[6] Dai, Y. H.; Yuan, Y. X., Nonlinear Conjugate Gradient Method (2000), Shanghai Scientific and Technical Publishers: Shanghai Scientific and Technical Publishers Shanghai
[7] Fatemi, M., A new efficient conjugate gradient method for unconstrained optimization, J. Comput. Appl. Math., 300, 207-216 (2016) · Zbl 1382.65170
[8] Yu, G. H.; Guan, L. T.; Li, G. Y., Global convergence of modifed polak-ribiere-polyak conjugate gradient methods with sufficient descent property, J. Ind. Manag. Optim., 4, 565-579 (2008) · Zbl 1168.65030
[9] Liu, H. W.; Liu, Z. X., An efficient barzilai-borwein conjugate gradient method for unconstrained optimization, J. Optim. Theory Appl., 180, 3, 879-906 (2019) · Zbl 1409.49031
[10] Yuan, G., Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems, Optim. Lett., 3, 1, 11-21 (2009) · Zbl 1154.90623
[11] Jiang, X. Z.; Jian, J. B., Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong wolfe line search, J. Comput. Appl. Math., 348, 525-534 (2019) · Zbl 1409.90092
[12] Liu, J. K.; Feng, Y. M., A spectral conjugate gradient method for solving large-scale unconstrained optimization, Comput. Math. Appl., 77, 3, 731-739 (2019) · Zbl 1442.90149
[13] Hager, W. W.; Zhang, H., A new conjugate gradient method with guaranteed descent and an efficient line search, SIAM J. Optim, 16, 1, 170-192 (2005) · Zbl 1093.90085
[14] Zhang, J. J.; Zhu, Z. B., An improved spectral conjugate gradient method for inverting absorption coefficient of medium, J. Guilin Univ. Electron.Technol., 38, 4, 313-316 (2018)
[15] Huang, H., A new conjugate gradient method for nonlinear unconstrained optimization problems, J. Henan Univ. (Natural Science Edition), 44, 2, 141-145 (2014) · Zbl 1346.90768
[16] Zhang, L., An improved wei-yao-liu nonlinear conjugate gradient method for optimization computation, Appl. Math. Comput., 215, 2269-2274 (2009) · Zbl 1181.65089
[17] Dai, Z. F.; Wen, F. H., Another improved wei-yao-liu nonlinear conjugate gradient method with sufficient descent property, Appl. Math. Comput., 218, 7421-7430 (2012) · Zbl 1254.65074
[18] Zhou, X. Q.; Lu, L. Z., The global convergence of modified DY conjugate gradient methods under the wolfe line search, J. Chongqing Normal Univ. (Natural Science Edition), 33, 3, 6-10 (2016) · Zbl 1363.90248
[19] Zoutendijk, G., Nonlinear programming, computational methods, (Abadie, J., Integer and Nonlinear Programming (1970), North-Holland: North-Holland Amsterdam), 37-86 · Zbl 0336.90057
[20] Andrei, N., An unconstrained optimization test functions collection, Adv. Model. Optim., 10, 1, 147-161 (2008) · Zbl 1161.90486
[21] Jian, J. B.; Zhang, Y.; Chao, M. T., A regularized alternating direction method of multipliers for a class of nonconvex problems, J. Inequal. Appl., 193, 16 (2019) · Zbl 1499.90172
[22] Woldu, T. G.; Zhang, H. B.; Zhang, X.; Zhang, F., A sufficient descent conjugate gradient method for nonlinear unconstrained optimization problems, Oper. Res. Trans., 22, 3, 59-68 (2018) · Zbl 1438.90339
[23] Dong, X.; Han, D.; Dai, Z.; Li, L.; Zhu, J., An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition, J. Optim. Theory Appl., 179, 3, 944-961 (2018) · Zbl 1402.90176
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.