An integer programming approach to optimal derivative accumulation

DOI10.1007/978-3-642-30023-3_20zbMATH Open1252.65053OpenAlexW177172224MaRDI QIDQ2913137FDOQ2913137

Authors: Jieqiu Chen, Jean Utke, Paul D. Hovland, Todd S. Munson 

Publication date: 26 September 2012

Published in: Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30023-3_20

Recommendations

• On lower bounds for optimal Jacobian accumulation
• scientific article; zbMATH DE number 2087173
• scientific article; zbMATH DE number 140023
• scientific article; zbMATH DE number 1269473
• Accumulating Jacobians as chained sparse matrix products

zbMATH Keywords

combinatorial optimizationinteger programmingvertex elimination

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Numerical differentiation (65D25)

Cited In (1)

• Obtaining analytic derivatives for a popular discrete-choice dynamic programming model

Uses Software

• XPRESS
• GAMS

This page was built for publication: An integer programming approach to optimal derivative accumulation

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