Matrix analyses on the Dai–Liao conjugate gradient method

Zohre Aminifard, Saman Babaie-Kafaki

Abstract


Some optimal choices for a parameter of the Dai–Liao conjugate gradient method are proposed by conducting matrix analyses of the method. More precisely, first the \(\ell_1\) and \(\ell_\infty\) norm condition numbers of the search direction matrix are minimized, yielding two adaptive choices for the Dai–Liao parameter. Then we show that a recent formula for computing this parameter which guarantees the descent property can be considered as a minimizer of the spectral condition number as well as the well-known measure function for a symmetrized version of the search direction matrix. Brief convergence analyses are also carried out. Finally, some numerical experiments on a set of test problems related to constrained and unconstrained testing environment, are conducted using a well-known performance profile.



doi:10.1017/S1446181119000063

Keywords


unconstrained optimization, conjugate gradient method, matrix norm, Dai–Liao parameter, condition number.



DOI: http://dx.doi.org/10.21914/anziamj.v61i0.13092



For new registrations: currently (May 2019) there is
a problem with the Captcha Validation. Until we fix, please
email editor@journal.austms.org.au and request
registration.

Remember, for most actions you have to record/upload into this online system
and then inform the editor/author via clicking on an email icon or Completion button.
ANZIAM Journal, ISSN 1446-8735, copyright Australian Mathematical Society.