Accessibility navigation

Approximating sparse Hessian matrices using large-scale linear least squares

Fawkes, J. M., Gould, N. I. M. and Scott, J. A. ORCID: (2023) Approximating sparse Hessian matrices using large-scale linear least squares. Numerical Algorithms. ISSN 1572-9265

Text (Open Access) - Published Version
· Available under License Creative Commons Attribution.
· Please see our End User Agreement before downloading.

[img] Text - Accepted Version
· Restricted to Repository staff only


It is advisable to refer to the publisher's version if you intend to cite from this work. See Guidance on citing.

To link to this item DOI: 10.1007/s11075-023-01681-z


Large-scale optimization algorithms frequently require sparse Hessian matrices that are not readily available. Existing methods for approximating large sparse Hessian matrices have limitations. To try and overcome these, we propose a novel approach that reformulates the problem as the solution of a large linear least squares problem. The least squares problem is sparse but can include a number of rows that contain significantly more entries than other rows and are regarded as dense. We exploit recent work on solving such problems using either the normal equations or an augmented system to derive a robust approach for computing approximate sparse Hessian matrices. Example sparse Hessians from the CUTEst test problem collection for optimization illustrate the effectiveness and robustness of the new method.

Item Type:Article
Divisions:Science > School of Mathematical, Physical and Computational Sciences > Department of Mathematics and Statistics
ID Code:113557


Downloads per month over past year

University Staff: Request a correction | Centaur Editors: Update this record

Page navigation