A modified Polak–Ribi‘ere–Polyak descent method for unconstrained optimization

Author： Qu Aiping   Li Min   Xiao Yue   Liu Juan  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.29, Iss.1, 2014-01, pp. : 177-188

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

Modification of the Wolfe Line Search Rules to Satisfy the Descent Condition in the Polak-Ribière-Polyak Conjugate Gradient Method

By Armand P.  

Journal of Optimization Theory and Applications, Vol. 132, Iss. 2, 2007-02 ,pp. : 287-305

Springer Publishing Company

Access to resources Recommend Favorite

Unconstrained Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds

By Bento G.  

Journal of Optimization Theory and Applications, Vol. 154, Iss. 1, 2012-07 ,pp. : 88-107

Springer Publishing Company

Access to resources Recommend Favorite

The Superlinear Convergence of a Modified BFGS-Type Method for Unconstrained Optimization

By Wei Zengxin   Yu Gaohang   Yuan Gonglin   Lian Zhigang  

Computational Optimization and Applications, Vol. 29, Iss. 3, 2004-12 ,pp. : 315-332

Springer Publishing Company

Access to resources Recommend Favorite

A new modified nonmonotone adaptive trust region method for unconstrained optimization

By Cui Zhaocheng  

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 795-806

Springer Publishing Company

Access to resources Recommend Favorite

An acceleration of gradient descent algorithm with backtracking for unconstrained optimization

By Andrei Neculai  

Numerical Algorithms, Vol. 42, Iss. 1, 2006-05 ,pp. : 63-73

Springer Publishing Company

Access to resources Recommend Favorite