A New Conjugate Gradient Algorithm with Sufficient Descent Property for Unconstrained Optimization

2Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new nonlinear conjugate gradient formula, which satisfies the sufficient descent condition, for solving unconstrained optimization problem is proposed. The global convergence of the algorithm is established under weak Wolfe line search. Some numerical experiments show that this new WWPNPRP+ algorithm is competitive to the SWPPRP+ algorithm, the SWPHS+ algorithm, and the WWPDYHS+ algorithm.

Cite

CITATION STYLE

APA

Wu, X., Liu, L., Xie, F., & Li, Y. (2015). A New Conjugate Gradient Algorithm with Sufficient Descent Property for Unconstrained Optimization. Mathematical Problems in Engineering, 2015. https://doi.org/10.1155/2015/352524

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free