Dissertation/ Thesis
On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures
| Τίτλος: | On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures |
|---|---|
| Συγγραφείς: | Sultana, Marzia, University of Lethbridge. Faculty of Arts and Science |
| Συνεισφορές: | Hossain, Shahadat |
| Στοιχεία εκδότη: | University of Lethbridge, Dept. of Mathematics and Computer Science Department of Mathematics and Computer Science Arts and Science |
| Έτος έκδοσης: | 2016 |
| Συλλογή: | University of Lethbridge Institutional Repository |
| Θεματικοί όροι: | algorithmic differentiation tools, black-box gradient, direction vectors, graph coloring, greedy CPR algorithm, sparsity patterns |
| Περιγραφή: | 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. |
| Τύπος εγγράφου: | thesis |
| Περιγραφή αρχείου: | application/pdf |
| Γλώσσα: | English |
| Relation: | Thesis (University of Lethbridge. Faculty of Arts and Science); https://hdl.handle.net/10133/4601 |
| Διαθεσιμότητα: | https://hdl.handle.net/10133/4601 |
| Αριθμός Καταχώρησης: | edsbas.6AE438DC |
| Βάση Δεδομένων: | BASE |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://hdl.handle.net/10133/4601# Name: EDS - BASE (ns324271) Category: fullText Text: View record from BASE |
|---|---|
| Header | DbId: edsbas DbLabel: BASE An: edsbas.6AE438DC RelevancyScore: 709 AccessLevel: 3 PubType: Dissertation/ Thesis PubTypeId: dissertation PreciseRelevancyScore: 709.17822265625 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Sultana%2C+Marzia%22">Sultana, Marzia</searchLink><br /><searchLink fieldCode="AR" term="%22University+of+Lethbridge%2E+Faculty+of+Arts+and+Science%22">University of Lethbridge. Faculty of Arts and Science</searchLink> – Name: Author Label: Contributors Group: Au Data: Hossain, Shahadat – Name: Publisher Label: Publisher Information Group: PubInfo Data: University of Lethbridge, Dept. of Mathematics and Computer Science<br />Department of Mathematics and Computer Science<br />Arts and Science – Name: DatePubCY Label: Publication Year Group: Date Data: 2016 – Name: Subset Label: Collection Group: HoldingsInfo Data: University of Lethbridge Institutional Repository – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22algorithmic+differentiation+tools%22">algorithmic differentiation tools</searchLink><br /><searchLink fieldCode="DE" term="%22black-box+gradient%22">black-box gradient</searchLink><br /><searchLink fieldCode="DE" term="%22direction+vectors%22">direction vectors</searchLink><br /><searchLink fieldCode="DE" term="%22graph+coloring%22">graph coloring</searchLink><br /><searchLink fieldCode="DE" term="%22greedy+CPR+algorithm%22">greedy CPR algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22sparsity+patterns%22">sparsity patterns</searchLink> – Name: Abstract Label: Description Group: Ab Data: 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. – Name: TypeDocument Label: Document Type Group: TypDoc Data: thesis – Name: Format Label: File Description Group: SrcInfo Data: application/pdf – Name: Language Label: Language Group: Lang Data: English – Name: NoteTitleSource Label: Relation Group: SrcInfo Data: Thesis (University of Lethbridge. Faculty of Arts and Science); https://hdl.handle.net/10133/4601 – Name: URL Label: Availability Group: URL Data: https://hdl.handle.net/10133/4601 – Name: AN Label: Accession Number Group: ID Data: edsbas.6AE438DC |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.6AE438DC |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English Subjects: – SubjectFull: algorithmic differentiation tools Type: general – SubjectFull: black-box gradient Type: general – SubjectFull: direction vectors Type: general – SubjectFull: graph coloring Type: general – SubjectFull: greedy CPR algorithm Type: general – SubjectFull: sparsity patterns Type: general Titles: – TitleFull: On the efficient determination of Hessian matrix sparsity pattern : algorithms and data structures Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Sultana, Marzia – PersonEntity: Name: NameFull: University of Lethbridge. Faculty of Arts and Science – PersonEntity: Name: NameFull: Hossain, Shahadat IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2016 Identifiers: – Type: issn-locals Value: edsbas |
| ResultId | 1 |