Title :
A Mixture Conjugate Gradient Method for Unconstrained Optimization
Author_Institution :
Sch. of Comput. Sci., Guangdong Polytech. Normal Univ., Guangzhou, China
Abstract :
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.
Keywords :
conjugate gradient methods; optimisation; global convergent; mixture conjugate gradient method; mixture method; unconstrained optimization; Computer science; Computer security; Convergence of numerical methods; Gradient methods; Informatics; Information security; Information technology; Iterative methods; Optimization methods; Radio frequency; Wolve condition; conjugate gradient method; fixed point; sufficient descent; unconstrained optimization;
Conference_Titel :
Intelligent Information Technology and Security Informatics (IITSI), 2010 Third International Symposium on
Conference_Location :
Jinggangshan
Print_ISBN :
978-1-4244-6730-3
Electronic_ISBN :
978-1-4244-6743-3
DOI :
10.1109/IITSI.2010.57
