Optimal Jacobian accumulation is NP-complete
From MaRDI portal
Publication:2465656
DOI10.1007/S10107-006-0042-ZzbMATH Open1158.68013OpenAlexW2045126306WikidataQ56429731 ScholiaQ56429731MaRDI QIDQ2465656FDOQ2465656
Authors: Uwe Naumann 
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
Recommendations
- Accumulating Jacobians as chained sparse matrix products
- An enhanced Markowitz rule for accumulating Jacobian matrices efficiently
- On lower bounds for optimal Jacobian accumulation
- scientific article
- On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Numerical differentiation (65D25)
Cites Work
- OpenAD/F
- Title not available (Why is that?)
- Augmented non-quadratic penalty algorithms
- The complexity of partial derivatives
- Solving Nonlinear Equations with Newton's Method
- Title not available (Why is that?)
- Algorithm 755: ADOL-C
- Title not available (Why is that?)
- Computational differentiation: techniques, applications, and tools
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hierarchical approaches to automatic differentiation
- 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
- Optimality-preserving elimination of linearities in Jacobian accumulation
- Accumulating Jacobians as chained sparse matrix products
- Title not available (Why is that?)
- Cheaper Jacobians by Simulated Annealing
Cited In (12)
- Zero variance differential geometric Markov chain Monte Carlo algorithms
- On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
- On lower bounds for optimal Jacobian accumulation
- A Simple and Efficient Tensor Calculus for Machine Learning
- An enhanced Markowitz rule for accumulating Jacobian matrices efficiently
- Automatic implementation of material laws: Jacobian calculation in a finite element code with TAPENADE
- Optimality-preserving elimination of linearities in Jacobian accumulation
- CLEAR: Covariant LEAst-Square Refitting with Applications to Image Restoration
- DAG reversal is NP-complete
- 15 years of Adjoint Algorithmic Differentiation (AAD) in finance
- A matrix-free exact Newton method
- Title not available (Why is that?)
Uses Software
This page was built for publication: Optimal Jacobian accumulation is NP-complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465656)
