ColPack
From MaRDI portal
Software:19104
No author found.
Related Items (33)
A polyhedral investigation of star colorings ⋮ Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation ⋮ On the Efficient Computation of Sparsity Patterns for Hessians ⋮ Lazy K-Way Linear Combination Kernels for Efficient Runtime Sparse Jacobian Matrix Evaluations in C++ ⋮ Implementation of Partial Separability in a Source-to-Source Transformation AD Tool ⋮ The complexity of restricted star colouring ⋮ Acyclic coloring of graphs with maximum degree 7 ⋮ Acyclic coloring with few division vertices ⋮ Acyclic colorings of graph subdivisions revisited ⋮ A framework for parallel second order incremental optimization algorithms for solving partially separable problems ⋮ On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians ⋮ Packing, partitioning, and covering symresacks ⋮ Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation ⋮ Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation ⋮ A computationally efficient fixed point approach to dynamic structural demand estimation ⋮ 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 ⋮ A benchmark of selected algorithmic differentiation tools on some problems in computer vision and machine learning ⋮ 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 ⋮ DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices ⋮ ColPack ⋮ Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope ⋮ On acyclically 4-colorable maximal planar graphs ⋮ Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope ⋮ \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria ⋮ Unnamed Item
This page was built for software: ColPack
