Globally Convergent Three-Term Conjugate Gradient Methods that Use Secant Conditions and Generate Descent Search Directions for Unconstrained Optimization

Author： Sugiki Kaori  

Publisher： Springer Publishing Company

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.153, Iss.3, 2012-06, pp. : 733-757

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization

By Andrei Neculai  

Numerical Algorithms, Vol. 65, Iss. 4, 2014-04 ,pp. : 859-874

Springer Publishing Company

Access to resources Recommend Favorite

Some descent three-term conjugate gradient methods and their global convergence

By Zhang Li   Zhou Weijun   Li Donghui  

Optimization Methods and Software, Vol. 22, Iss. 4, 2007-08 ,pp. : 697-711

Taylor & Francis Ltd

Access to resources Recommend Favorite

Another Conjugate Gradient Algorithm with Guaranteed Descent and Conjugacy Conditions for Large-scale Unconstrained Optimization

By Andrei Neculai  

Journal of Optimization Theory and Applications, Vol. 159, Iss. 1, 2013-10 ,pp. : 159-182

Springer Publishing Company

Access to resources Recommend Favorite

Hybrid conjugate gradient methods for unconstrained optimization

By Mo Jiangtao   Gu Nengzhu   Wei Zengxin  

Optimization Methods and Software, Vol. 22, Iss. 2, 2007-04 ,pp. : 297-307

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Class of Nonmonotone Conjugate Gradient Methods for Unconstrained Optimization

By Liu G.H.   Jing L.L.   Han L.X.   Han D.  

Journal of Optimization Theory and Applications, Vol. 101, Iss. 1, 1999-04 ,pp. : 127-140

Springer Publishing Company

Access to resources Recommend Favorite