Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
From MaRDI portal
Publication:5268940
DOI10.1080/10556788.2016.1230612zbMath1381.65024OpenAlexW2523771017WikidataQ60692369 ScholiaQ60692369MaRDI QIDQ5268940
Julien Herrmann, Guillaume Aupy
Publication date: 21 June 2017
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01654632/file/main-revision.pdf
optimizationautomatic differentiationcheckpointingasymptotic optimalityonlineprogram reversaladjoint computationgradient of a function
Analysis of algorithms (68W40) Nonlinear programming (90C30) Numerical differentiation (65D25) Complexity and performance of numerical algorithms (65Y20) Inverse problems in optimal control (49N45)
Uses Software
Cites Work
- New Algorithms for Optimal Online Checkpointing
- A-revolve: an adaptive memory-reduced procedure for calculating adjoints; with an application to computing adjoints of the instationary Navier–Stokes system
- MultiStage Approaches for Optimal Offline Checkpointing
- Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
- Algorithm 799: revolve