A new conjugate gradient algorithm with cubic Barzilai–Borwein stepsize for unconstrained optimization. (4th May 2019)

• Record Type: Journal Article
• Authors: Momeni, M.; Peyghami, M.R.
• Is Part Of: Optimization methods and software. Volume 34:Number 3(2019)
• Page Start: 650
• Page End: 664
• Publication Date: 2019-05-04
• Subjects: Conjugate gradient methods -- Dai–Liao family -- Cubic regularization model -- CG_DESCENT method; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2017.1414813
• Languages: English
• ISSNs: 1055-6788

Abstract

Abstract : In this paper, a new conjugate gradient (CG) algorithm in Dai–Liao (DL) family is presented for solving unconstrained optimization problems. The proposed algorithm tries to adjust positive values for the so-called DL parameter by using quadratic and/or cubic models of the objective function. More precisely, the cubic regularization model of the objective function is properly employed when the non-positive curvature is detected. Besides, the CG parameter is introduced so that the generated CG directions are descent. Under some standard assumptions, we establish the convergence property of the new proposed algorithm. Numerical results on some test problems are reported. The results show that the new algorithm performs well and is competitive with CG_DESCENT method.