4 results for “Sufficient Descent Condition”

Set a search alert

Research ArticleOpen accessPhrase in the titleSufficient Descent Condition of the Polak-Ribière-Polyak (PRP) Conjugate Gradient Method without Line SearchAbdelrahman A., KH. I. Osman, Osman O.O. Yousif et al.Nonlinear conjugate gradient methods for unconstrained optimization problems are used in many aspects of theoretical and applied sciences. They are iterative methods, so at any iteration a step length is computed using a method called line search. In most cases, the sufficient descent condition plays an important role to prove the global convergence of a conjugate gradient method. Due to … …Journal of Mathematics and Statistics, Vol. 18, Issue 1 · 14 Mar 2022 · 6,360 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsA Developed Version of Conjugate Gradient Method With a New Parameter for Dai-Liao Conjugacy Condition With an Application to Solar PanelAhmad Alhawarat, Ramadan Sabra, Mehiddin Al-Baali et al.Conjugate Gradient (CG) methods are broadly employed in solving bigger-scale unconstrained optimization problems. Two famous methods are the Hestenes–Stiefel (HS) as well as Polak–Ribière–Polyak (PRP) CG methods, which usually work well in practice. However, they cannot satisfy the Global Convergence (GC) property. To retain and enhance the previous practical behavior as well as rectify the latter difficulty, this paper constructs … …Journal of Computer Science, Vol. 21, Issue 7 · 15 Jul 2025 · 3,147 accessesView PDF Cite

Research ArticleOpen accessIn the keywordsNew Scaled Sufficient Descent Conjugate Gradient Algorithm for Solving Unconstraint Optimization ProblemsAbbas Y. AL-Bayati, Rafiq S. MuhammadProblem statement: The scaled hybrid Conjugate Gradient (CG) algorithm which usually used for solving non-linear functions was presented and was compared with two standard well-Known NAG routines, yielding a new fast comparable algorithm. Approach: We proposed, a new hybrid technique based on the combination of two well-known scaled (CG) formulas for the quadratic model in unconstrained optimization using exact line … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,046 accessesView PDF Cite

Research ArticleOpen accessIn the abstractA Robust Modification of Hestenes–Stiefel Conjugate Gradient Method with Strong Wolfe Line SearchAwad Abdelrahman, Osman O.O. Yousif, Khalid I. OsmanNonlinear Conjugate Gradient (CG) methods are extensively used for solving large-scale unconstrained optimization problems. Numerous of studies constructed scales and modifications have been conducted recently to improve (CG) methods. In this paper, a simple modified by its conjugate gradient method was proposed. In addition to, established global convergence property and sufficient descent condition, under Strong Wolfe line search. Numerical result … …Journal of Mathematics and Statistics, Vol. 16, Issue 1 · 14 May 2020 · 6,743 accessesView PDF Cite