By Topic

A Mixture Conjugate Gradient Method for Unconstrained Optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Hailin Liu ; Sch. of Comput. Sci., Guangdong Polytech. Normal Univ., Guangzhou, China

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.

Published in:

Intelligent Information Technology and Security Informatics (IITSI), 2010 Third International Symposium on

Date of Conference:

2-4 April 2010