Optimal Jacobian accumulation is NP-complete
From MaRDI portal
Publication:2465656
DOI10.1007/s10107-006-0042-zzbMath1158.68013OpenAlexW2045126306WikidataQ56429731 ScholiaQ56429731MaRDI QIDQ2465656
Publication date: 7 January 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0042-z
Numerical differentiation (65D25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs ⋮ Zero variance differential geometric Markov chain Monte Carlo algorithms ⋮ Unnamed Item ⋮ Automatic implementation of material laws: Jacobian calculation in a finite element code with TAPENADE ⋮ On lower bounds for optimal Jacobian accumulation ⋮ A Simple and Efficient Tensor Calculus for Machine Learning ⋮ CLEAR: Covariant LEAst-Square Refitting with Applications to Image Restoration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality-preserving elimination of linearities in Jacobian accumulation
- The complexity of partial derivatives
- Accumulating Jacobians as chained sparse matrix products
- Augmented non-quadratic penalty algorithms
- Automatic differentiation: Applications, theory, and implementations. Selected papers based on the presentation at the 4th international conference on automatic differentiation (AD), Chicago, IL, USA, July 20--23, 2004
- Hierarchical approaches to automatic differentiation
- OpenAD/F
- Algorithm 755: ADOL-C
- Solving Nonlinear Equations with Newton's Method
- Cheaper Jacobians by Simulated Annealing
- Computational differentiation: techniques, applications, and tools
This page was built for publication: Optimal Jacobian accumulation is NP-complete
