Back to search

Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science

On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures

Abstract

dc:description.abstract

Evaluation of the Hessian matrix of a scalar function is a subproblem in many numerical optimization algorithms. For large-scale problems often the Hessian matrix is sparse and structured, and it is preferable to exploit such information when available. Using symmetry in the second derivative values of the components it is possible to detect the sparsity pattern of the Hessian via products of the Hessian matrix with specially chosen direction vectors. We use graph coloring methods and employ efficient sparse data structures to implement the sparsity pattern detection algorithms.

Degree

thesis:*
Level thesis:degree_level
Masters
Grantor dc:publisher
Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Sultana, Marzia
  • University of Lethbridge. Faculty of Arts and Science
Advisor dc:contributor.supervisor
  • Hossain, Shahadat

Subjects

dc:subject × 6

Rights

Language dc:language.iso
en_CA

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10133/4601

Chain of custody

source
Harvested from
University of Lethbridge
Base URL
opus.uleth.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Sultana, Marzia; University of Lethbridge. Faculty of Arts and Science. On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures. Masters thesis, Lethbridge, Alta : University of Lethbridge, Dept. of Mathematics and Computer Science, 2016. https://hdl.handle.net/10133/4601