论文信息 - A Mixture Conjugate Gradient Method for Unconstrained Optimization

A Mixture Conjugate Gradient Method for Unconstrained Optimization

In this paper a new conjugate gradient method for unconstrained optimization has been proposed, furthermore a mixture algorithm has been proposed, we have proved that the new method and the mixture method using inexact line search is sufficient descent and global convergent, and the numerical result shows that the new method is effective.

Hailin Liu

[1] Michael Anthony Wolfe,et al. Numerical Methods for Unconstrained Optimization: An Introduction , 1979 .

[2] Ya-Xiang Yuan,et al. A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property , 1999, SIAM J. Optim..

[3] Ya-Xiang Yuan,et al. A three-parameter family of nonlinear conjugate gradient methods , 2001, Math. Comput..

[4] Jorge J. Moré,et al. Testing Unconstrained Optimization Software , 1981, TOMS.