ColPack

DOI10.1145/2513109.2513110zbMath1295.65144OpenAlexW1991173503WikidataQ113310325 ScholiaQ113310325MaRDI QIDQ3189693

No author found.

Publication date: 12 September 2014

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2513109.2513110

zbMATH Keywords

combinatorial optimizationnonlinear optimizationgraph coloringautomatic differentiationgreedy coloring algorithmssparse derivative computationvertex ordering techniques

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Nonlinear programming (90C30) Combinatorial optimization (90C27) Numerical differentiation (65D25) Coloring of graphs and hypergraphs (05C15) Packaged methods for numerical algorithms (65Y15)

Related Items (9)

The complexity of restricted star colouring ⋮ A framework for parallel second order incremental optimization algorithms for solving partially separable problems ⋮ Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation ⋮ A computationally efficient fixed point approach to dynamic structural demand estimation ⋮ 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 ⋮ DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices

Uses Software

• Unnamed Item
• METIS
• SparseMatrix
• ColPack
• Harwell-Boeing sparse matrix collection
• ADIC2
• DSJM

This page was built for publication: ColPack