On exact linesearch quasi-Newton methods for minimizing a quadratic function

From MaRDI portal
Publication:683343

DOI10.1007/S10589-017-9940-7zbMATH Open1411.90248arXiv1503.01892OpenAlexW3098015857MaRDI QIDQ683343FDOQ683343


Authors: Anders Forsgren, Tove Odland Edit this on Wikidata


Publication date: 6 February 2018

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Abstract: This paper concerns exact linesearch quasi-Newton methods for minimizing a quadratic function whose Hessian is positive definite. We show that by interpreting the method of conjugate gradients as a particular exact linesearch quasi-Newton method, necessary and sufficient conditions can be given for an exact linesearch quasi-Newton method to generate a search direction which is parallel to that of the method of conjugate gradients. We also analyze update matrices and give a complete description of the rank-one update matrices that give search direction parallel to those of the method of conjugate gradients. In particular, we characterize the family of such symmetric rank-one update matrices that preserve positive definiteness of the quasi-Newton matrix. This is in contrast to the classical symmetric-rank-one update where there is no freedom in choosing the matrix, and positive definiteness cannot be preserved. The analysis is extended to search directions that are parallel to those of the preconditioned method of conjugate gradients in a straightforward manner.


Full work available at URL: https://arxiv.org/abs/1503.01892




Recommendations




Cites Work


Cited In (8)





This page was built for publication: On exact linesearch quasi-Newton methods for minimizing a quadratic function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683343)