Efficient detection of Hessian matrix sparsity pattern

DOI10.1145/3055282.3055287zbMATH Open1365.65120OpenAlexW2591955687MaRDI QIDQ5268818FDOQ5268818

Authors: R. G. Carter, Shahadat Hossain, Marzia Sultana 

Publication date: 21 June 2017

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3055282.3055287

Recommendations

• On the efficient computation of sparsity patterns for Hessians
• Pattern graph for sparse Hessian matrix
• Estimation of sparse hessian matrices and graph coloring problems
• scientific article
• Computing sparse Hessians with automatic differentiation

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Data structures (68P05) Coloring of graphs and hypergraphs (05C15)

Cites Work

• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Title not available (Why is that?)
• An efficient overloaded implementation of forward mode automatic differentiation in MATLAB
• Detecting Jacobian sparsity patterns by Bayesian probing

Cited In (4)

• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
• The hessian in funtion minization
• A polynomial-time algorithm for detecting directed axial symmetry in Hessian computational graphs
• Estimation of sparse hessian matrices and graph coloring problems

Uses Software

• ADOL-C
• DSJM

This page was built for publication: Efficient detection of Hessian matrix sparsity pattern

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