On lower bounds for optimal Jacobian accumulation

DOI10.1080/10556788.2017.1397145zbMATH Open1453.65110OpenAlexW2770397219MaRDI QIDQ4685609FDOQ4685609

Authors: Viktor Mosenkis, Uwe Naumann 

Publication date: 9 October 2018

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

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

Recommendations

• On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
• scientific article; zbMATH DE number 1269473
• scientific article; zbMATH DE number 140023
• Markowitz-Type Heuristics for Computing Jacobian Matrices Efficiently
• Optimal Jacobian accumulation is NP-complete

zbMATH Keywords

lower boundsbranch and boundedge eliminationvertex eliminationoptimal Jacobian accumulation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• On optimality preserving eliminations for the minimum edge count and optimal Jacobian accumulation problems in linearized DAGs
• Stochastic Algorithms: Foundations and Applications
• An integer programming approach to optimal derivative accumulation
• Title not available (Why is that?)
• Optimal Jacobian accumulation is NP-complete

Uses Software

• OpenAD/F

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685609)