Another hybrid conjugate gradient method and its global convergence for unconstrained optimization

CCDC 2011
Pages: 2681 - 2685
Published: May 23, 2011
Abstract
In this paper, a hybrid conjugate gradient method is proposed for solving unconstrained optimization problems. The parameter β k null is computed as a convex combination of β k PRP and β k ∗ algorithms. The parameter θ k null is computed in such a way so that the direction corresponding to the conjugate gradient algorithm to be the Quasi-Newton equation. It is sufficient descent at every iteration. The theoretical analysis shows that the...
Paper Details
Title
Another hybrid conjugate gradient method and its global convergence for unconstrained optimization
Published Date
May 23, 2011
Journal
Pages
2681 - 2685
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.