Global Convergence Of A Special Case Of The Dai–Yuan Family Without Line Search
AbstractConjugate gradient methods are efficient to minimize differentiable objective functions in large dimension spaces. Recently, Dai and Yuan introduced a tree-parameter family of nonlinear conjugate gradient methods and show their convergence. However, line search strategies usually bring computational burden. To overcome this problem, in this paper, we study the global convergence of a special case of three-parameter family(the CD-DY family) in which the line search procedures are replaced by fixed formulae of stepsize.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by World Scientific Publishing Co. Pte. Ltd. in its journal Asia-Pacific Journal of Operational Research.
Volume (Year): 25 (2008)
Issue (Month): 03 ()
Contact details of provider:
Web page: http://www.worldscinet.com/apjor/apjor.shtml
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tai Tone Lim).
If references are entirely missing, you can add them using this form.