首页|Spectral Three-Term Constrained Conjugate Gradient Algorithm for Function Minimizations

Spectral Three-Term Constrained Conjugate Gradient Algorithm for Function Minimizations

扫码查看
原文链接
  • NSTL
  • Hindawi Publishing Group
In this work, we tend to deal within the ?eld of the constrained optimization methods of three-term Conjugate Gradient (CG) technique which is primarily based on Dai-Liao (DL) formula. ?e new proposed technique satis?es the conjugacy property and the descent conditions of Karush-Kuhn-Tucker (K.K.T.). Our planned constrained technique uses the robust Wolfe line search condition with some assumptions. We tend to prove the global convergence property of the new planned technique. Numeral comparisons for (30-thirty) constrained optimization issues make sure the e?ectiveness of the new planned formula.

Spectral Three-Term ConstrainedConjugate Gradient AlgorithmFunction Minimizations

Huda I. Ahmed、Rana Z. Al-Kawaz、Abbas Y. Al-Bayati

展开 >

Department of Operations Researches and Intelligent Techniques, College of Computer Sciences and Mathematics, University of Mosul, Mosul, Iraq

Department of Mathematics, College of Basic Education, University of Telafer, Mosul, Iraq

University of Telafer, Mosul, Iraq

2019

10.1155/2019/6378368

Journal of applied mathematics

Journal of applied mathematics

EI
ISSN：1110-757X
年,卷(期)：2019.2019(Pt.4)
  • 3
  • 21