Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
From MaRDI portal
Publication:2901061
DOI10.1287/IJOC.1080.0286zbMath1243.65071DBLPjournals/informs/GebremedhinTPW09OpenAlexW2133400152WikidataQ55966569 ScholiaQ55966569MaRDI QIDQ2901061
Arijit Tarafdar, Andrea Walther, Alex Pothen, Assefaw Hadish Gebremedhin
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0be26b5e26f62f7edad2543b981b6d7067af9879
automatic differentiationacyclic coloringstar coloringcombinatorial scientific computingsparse Hessian computation
Related Items (28)
A new framework for the computation of Hessians ⋮ Minotaur: a mixed-integer nonlinear optimization toolkit ⋮ A polyhedral investigation of star colorings ⋮ Acyclic coloring of graphs with maximum degree 7 ⋮ Acyclic coloring with few division vertices ⋮ Acyclic colorings of graph subdivisions revisited ⋮ On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ Packing, partitioning, and covering symresacks ⋮ On structural parameterizations of star coloring ⋮ Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation ⋮ Hardness transitions and uniqueness of acyclic colouring ⋮ Recycling basic columns of the splitting preconditioner in interior point methods ⋮ Acyclically 3-colorable planar graphs ⋮ \(\mathcal Q\)-Ramsey classes of graphs ⋮ JuMP: A Modeling Language for Mathematical Optimization ⋮ Acyclic improper colouring of graphs with maximum degree 4 ⋮ Unnamed Item ⋮ On efficient Hessian computation using the edge pushing algorithm in Julia ⋮ Pattern graph for sparse Hessian matrix determination ⋮ A polyhedral study of the acyclic coloring problem ⋮ Higher-order reverse automatic differentiation with emphasis on the third-order ⋮ Acyclic 3-coloring of generalized Petersen graphs ⋮ Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope ⋮ On acyclically 4-colorable maximal planar graphs ⋮ A Simple and Efficient Tensor Calculus for Machine Learning ⋮ Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope ⋮ Computing the sparsity pattern of Hessians using automatic differentiation ⋮ \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
Uses Software
This page was built for publication: Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
