Optimal Multistage Algorithm for Adjoint Computation

DOI10.1137/15M1019222zbMath1416.65581OpenAlexW4300994058MaRDI QIDQ2815691

Julien Herrmann, Guillaume Aupy, Yves Robert, Paul D. Hovland

Publication date: 30 June 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1019222

zbMATH Keywords

automatic differentiationcheckpointingoptimal algorithmsprogram reversaladjoint computation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonlinear programming (90C30) Applications of optimal control and differential games (49N90) Complexity and performance of numerical algorithms (65Y20)

Related Items (2)

Randomized Sketching Algorithms for Low-Memory Dynamic Optimization ⋮ Optimal memory-aware backpropagation of deep join networks

Uses Software

• revolve
• MITgcm

Cites Work

• Evaluating Derivatives
• MultiStage Approaches for Optimal Offline Checkpointing
• Algorithm 799: revolve
• An introduction to the adjoint approach to design

This page was built for publication: Optimal Multistage Algorithm for Adjoint Computation