A new kind of parameter conjugate gradient for unconstrained optimization

23Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

The key feature for conjugate gradient methods is a conjugate parameter optimal for solving unrestrained minimization functions. In this paper, a replacement new parameter conjugate gradient for unconstrained optimization. The sufficient descent property cleave to. The global convergence property of the new method is proved under some assumptions. Numerical results explain that the new parameter is superior in practice.

Cite

CITATION STYLE

APA

Hassan, B. A., Dahawi, H. O., & Younus, A. S. (2019). A new kind of parameter conjugate gradient for unconstrained optimization. Indonesian Journal of Electrical Engineering and Computer Science, 17(1), 404–411. https://doi.org/10.11591/ijeecs.v17.i1.pp404-411

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