Pages that link to "Item:Q2901061"

The following pages link to Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation (Q2901061):

Displaying 27 items.

• A polyhedral investigation of star colorings (Q284838) (← links)
• Acyclic coloring with few division vertices (Q396683) (← links)
• On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
• Acyclically 3-colorable planar graphs (Q695319) (← links)
• Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
• Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation (Q1694294) (← links)
• \(\mathcal Q\)-Ramsey classes of graphs (Q1761462) (← links)
• Acyclic colorings of graph subdivisions revisited (Q1932357) (← links)
• Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) (← links)
• \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria (Q2088964) (← links)
• Packing, partitioning, and covering symresacks (Q2192122) (← links)
• On acyclically 4-colorable maximal planar graphs (Q2318233) (← links)
• Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
• Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
• Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope (Q2840711) (← links)
• A new framework for the computation of Hessians (Q2885473) (← links)
• (Q4558473) (← links)
• On efficient Hessian computation using the edge pushing algorithm in Julia (Q4685595) (← links)
• Pattern graph for sparse Hessian matrix determination (Q4685608) (← links)
• A Simple and Efficient Tensor Calculus for Machine Learning (Q4988921) (← links)
• Computing the sparsity pattern of Hessians using automatic differentiation (Q5498686) (← links)
• JuMP: A Modeling Language for Mathematical Optimization (Q5738130) (← links)
• A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
• Higher-order reverse automatic differentiation with emphasis on the third-order (Q5962714) (← links)
• Acyclic 3-coloring of generalized Petersen graphs (Q5963660) (← links)
• Hardness transitions and uniqueness of acyclic colouring (Q6145810) (← links)
• Recycling basic columns of the splitting preconditioner in interior point methods (Q6166647) (← links)