×

A scaled conjugate gradient method with moving asymptotes for unconstrained optimization problems. (English) Zbl 1364.65124

Summary: In this paper, a scaled method that combines the conjugate gradient with moving asymptotes is presented for solving the large-scaled nonlinear unconstrained optimization problem. A diagonal matrix is obtained by the moving asymptote technique, and a scaled gradient is determined by multiplying the gradient with the diagonal matrix. The search direction is either a scaled conjugate gradient direction or a negative scaled gradient direction under different conditions. This direction is sufficient descent if the step size satisfies the strong Wolfe condition. A global convergence analysis of this method is also provided. The numerical results show that the scaled method is efficient for solving some large-scaled nonlinear problems.

MSC:

65K05 Numerical mathematical programming methods
90C30 Nonlinear programming
49M37 Numerical methods based on nonlinear programming

Software:

CUTEr; SifDec
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] M. Al-Baali, A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization,, Computational Optimization and Applications, 60, 89 (2015) · Zbl 1315.90051 · doi:10.1007/s10589-014-9662-z
[2] N. Andrei, An unconstrained optimization test functions collection,, Advanced Modeling and Optimization, 10, 147 (2008) · Zbl 1161.90486
[3] Y. Dai, A nonlinear conjugate gradient method with a strong global convergence property,, SIAM Journal on Optimization, 10, 177 (1999) · Zbl 0957.65061 · doi:10.1137/S1052623497318992
[4] Y. Dai, A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search,, SIAM Journal on Optimization, 23, 296 (2013) · Zbl 1266.49065 · doi:10.1137/100813026
[5] E. D. Dolan, Benchmarking optimization software with performance profiles,, Mathematical Programming, 91, 201 (2002) · Zbl 1049.90004 · doi:10.1007/s101070100263
[6] R. Fletcher, Function minimization by conjugate gradients,, The Computer Journal, 7, 149 (1964) · Zbl 0132.11701 · doi:10.1093/comjnl/7.2.149
[7] N. I. M. Gould, CUTEr and SifDec: A constrained and unconstrained testing environment, revisited,, ACM Transactions on Mathematical Software, 29, 353 (2003) · Zbl 1068.90525 · doi:10.1145/962437.962438
[8] W. Hager, A new conjugate gradient method with guaranteed descent and an efficient line search,, SIAM Journal on Optimization, 16, 170 (2005) · Zbl 1093.90085 · doi:10.1137/030601880
[9] W. Hager, The limited memory conjugate gradient method,, SIAM Journal on Optimization, 23, 2150 (2013) · Zbl 1298.90129 · doi:10.1137/120898097
[10] M. R. Hestenes, Methods of conjugate gradients for solving linear systems,, Journal of Research of the National Bureau of Standards, 49, 409 (1952) · Zbl 0048.09901 · doi:10.6028/jres.049.044
[11] D. Luenberger, <em>Linear and Nonlinear Programming</em>,, \(3^{rd}\) edition (2008)
[12] W. Nakamura, Nonlinear conjugate gradient methods with sufficient descent properties for unconstrained optimization,, Journal of Industrial and Management Optimization, 9, 595 (2013) · Zbl 1281.90057 · doi:10.3934/jimo.2013.9.595
[13] Y. Narushima, A three-term conjugate gradient method with sufficient descent property for unconstrained optimization,, SIAM Journal on Optimization, 21, 212 (2011) · Zbl 1250.90087 · doi:10.1137/080743573
[14] Q. Ni, A globally convergent method of moving asymptotes with trust region technique,, Optimization methods and software, 18, 283 (2003) · Zbl 1042.90042 · doi:10.1080/1055678031000118491
[15] E. Polak, Note sur la convergence de méthodes de directions conjuguées,, Revue française d’informatique et de recherche opérationnelle, 3, 35 (1969) · Zbl 0174.48001
[16] B. T. Polyak, The conjugate gradient method in extremal problems,, USSR Computational Mathematics and Mathematical Physics, 9, 94 (1969) · Zbl 0229.49023 · doi:10.1016/0041-5553(69)90035-4
[17] K. Svanberg, The method of moving asymptotes-a new method for structural optimization,, International Journal for Numerical Methods in Engineering, 24, 359 (1987) · Zbl 0602.73091 · doi:10.1002/nme.1620240207
[18] H. Wang, A new method of moving asymptotes for large-scale unconstrained optimization,, Applied Mathematics and Computaiton, 203, 62 (2008) · Zbl 1159.65066 · doi:10.1016/j.amc.2008.03.035
[19] W. Zhou, On the strong convergence of a modified Hestenes-Stiefel method for nonconvex optimization,, Journal of Industrial and Management Optimization, 9, 893 (2013) · Zbl 1281.90062 · doi:10.3934/jimo.2013.9.893
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.