On lower bounds for optimal Jacobian accumulation

DOI10.1080/10556788.2017.1397145zbMath1453.65110OpenAlexW2770397219MaRDI QIDQ4685609

Uwe Naumann, Viktor Mosenkis

Publication date: 9 October 2018

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2017.1397145

zbMATH Keywords

branch and boundlower boundsedge eliminationvertex eliminationoptimal Jacobian accumulation

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• OpenAD/F

Cites Work

• Augmented non-quadratic penalty algorithms
• Optimal Jacobian accumulation is NP-complete
• On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
• Evaluating Derivatives
• OpenAD/F
• A Note on the NP-Completeness of Vertex Elimination on Directed Graphs
• Computational Graphs and Rounding Error
• Algorithmic Aspects of Vertex Elimination on Directed Graphs

This page was built for publication: On lower bounds for optimal Jacobian accumulation