The convergence rate of a three-term HS method with restart strategy for unconstrained optimization problems

ISSN： 0233-1934

Source： Optimization, Vol.63, Iss.9, 2014-09, pp. : 1387-1400

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

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

New three-term conjugate gradient method with guaranteed global convergence

By Liu J.K. Li S.J.

International Journal of Computer Mathematics, Vol. 91, Iss. 8, 2014-08 ,pp. : 1744-1754

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Sugiki Kaori

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

Springer Publishing Company

Access to resources Recommend Favorite

A variational method for unconstrained optimization problems

International Journal of Computer Mathematics, Vol. 84, Iss. 4, 2007-04 ,pp. : 491-503

Taylor & Francis Ltd

Access to resources Recommend Favorite

Global Convergence of a Memory Gradient Method for Unconstrained Optimization

By Narushima Yasushi Yabe Hiroshi

Computational Optimization and Applications, Vol. 35, Iss. 3, 2006-11 ,pp. : 325-346

Springer Publishing Company

Access to resources Recommend Favorite