Pattern graph for sparse Hessian matrix determination

DOI10.1080/10556788.2018.1458849zbMath1401.90193OpenAlexW2797676708WikidataQ130037732 ScholiaQ130037732MaRDI QIDQ4685608

Shahadat Hossain, Nasrin Hakim Mithila

Publication date: 9 October 2018

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2018.1458849

zbMATH Keywords

multicolouringsparse Hessiancompression-reconstructiondirect determination

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Nonlinear programming (90C30) Newton-type methods (49M15) Combinatorial optimization (90C27) Data structures (68P05)

Uses Software

• AMPL
• ColPack
• DSJM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph models and their efficient implementation for sparse Jacobian matrix determination
• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
• Optimal direct determination of sparse Jacobian matrices
• Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
• Determining Sparse Jacobian Matrices Using Two-Sided Compression: An Algorithm and Lower Bounds
• ColPack
• Estimation of Sparse Jacobian Matrices
• New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
• Evaluating Derivatives
• Estimation of sparse hessian matrices and graph coloring problems
• On the Estimation of Sparse Hessian Matrices
• A graph coloring algorithm for large scheduling problems
• Computing a sparse Jacobian matrix by rows and columns
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

This page was built for publication: Pattern graph for sparse Hessian matrix determination