Rezumat articol ediţie STUDIA UNIVERSITATIS BABEŞ-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

 
       
         
    STUDIA MATHEMATICA - Ediţia nr.2 din 2024  
         
  Articol:   NEW HYBRID CONJUGATE GRADIENT METHOD AS A CONVEX COMBINATION OF PRP AND RMIL+ METHODS.

Autori:  GHANIA HADJI, YAMINA LASKRI, TAHAR BECHOUAT, RACHID BENZINE.
 
       
         
  Rezumat:   DOI: 10.24193/subbmath.2024.2.14

Received 18 February 2022; Accepted 27 April 2022.
pp. 457-468

VIEW PDF


FULL PDF

The Conjugate Gradient (CG) method is a powerful iterative approach for solving large-scale minimization problems, characterized by its simplicity, low computation cost and good convergence. In this paper, a new hybrid conjugate gradient HLB method (HLB: Hadji-Laskri-Bechouat) is proposed and analysed for unconstrained optimization. We compute the parameter Ξ²HLBkπ›½π‘˜π»πΏπ΅ as a convex combination of the Polak-Ribi`{e}re-Polyak (Ξ²PRPk)[1](π›½π‘˜π‘ƒπ‘…π‘ƒ)[1] and the Mohd Rivaie-Mustafa Mamat and Abdelrhaman Abashar (Ξ²RMIL+k)(π›½π‘˜π‘…π‘€πΌπΏ+) i.e Ξ²HLBk=(1βˆ’ΞΈk)Ξ²PRPk+ΞΈkΞ²RMIL+kπ›½π‘˜π»πΏπ΅=(1βˆ’πœƒπ‘˜)π›½π‘˜π‘ƒπ‘…π‘ƒ+πœƒπ‘˜π›½π‘˜π‘…π‘€πΌπΏ+. By comparing numerically CGHLB with PRP and RMIL+ and by using the Dolan and More CPU performance, we deduce that CGHLB is more efficient.

Mathematics Subject Classification (2010): 90C26, 65H10, 65K05, 90C26, 90C06.

Keywords: Unconstrained optimization, hybrid conjugate gradient method, line search, descent property, global convergence.
 
         
     
         
         
      Revenire la pagina precedentă