ColPack

swMATH7045MaRDI QIDQ19104FDOQ19104

Author name not available (Why is that?)

Cited In (33)

• Exploiting sparsity in Jacobian computation via coloring and automatic differentiation: A case study in a simulated moving bed process
• On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
• Acyclic coloring with few division vertices
• A polyhedral study of the acyclic coloring problem
• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
• Acyclically 3-colorable planar graphs
• A polyhedral investigation of star colorings
• Acyclic coloring of graphs with maximum degree 7
• On the efficient computation of sparsity patterns for Hessians
• \(\mathcal Q\)-Ramsey classes of graphs
• On efficient Hessian computation using the edge pushing algorithm in Julia
• Acyclic colorings of graph subdivisions revisited
• On acyclically 4-colorable maximal planar graphs
• A computationally efficient fixed point approach to dynamic structural demand estimation
• The complexity of restricted star colouring
• Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope
• Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope
• Higher-order reverse automatic differentiation with emphasis on the third-order
• Acyclic improper colouring of graphs with maximum degree 4
• Efficient computation of sparse hessians using coloring and automatic differentiation
• Packing, partitioning, and covering symresacks
• ColPack, software for graph coloring and related problems in scientific computing
• Title not available (Why is that?)
• Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation
• A benchmark of selected algorithmic differentiation tools on some problems in computer vision and machine learning
• Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation
• A framework for parallel second order incremental optimization algorithms for solving partially separable problems
• JuMP: a modeling language for mathematical optimization
• \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria
• 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
• Acyclic 3-coloring of generalized Petersen graphs
• Pattern graph for sparse Hessian matrix

This page was built for software: ColPack