Periodicity in optimal hierarchical checkpointing schemes for adjoint computations

DOI10.1080/10556788.2016.1230612zbMATH Open1381.65024OpenAlexW2523771017WikidataQ60692369 ScholiaQ60692369MaRDI QIDQ5268940FDOQ5268940

Julien Herrmann, Guillaume Aupy

Publication date: 21 June 2017

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

Full work available at URL: https://hal.inria.fr/hal-01654632/file/main-revision.pdf

zbMATH Keywords

optimizationonlineasymptotic optimalityautomatic differentiationcheckpointingprogram reversaladjoint computationgradient of a function

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms (68W40) Nonlinear programming (90C30) Inverse problems in optimal control (49N45) Numerical differentiation (65D25)

Cites Work

• Algorithm 799: revolve
• Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
• New Algorithms for Optimal Online Checkpointing
• MultiStage Approaches for Optimal Offline Checkpointing
• A-revolve: an adaptive memory-reduced procedure for calculating adjoints; with an application to computing adjoints of the instationary Navier–Stokes system

Cited In (1)

• Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation

Uses Software

• revolve

This page was built for publication: Periodicity in optimal hierarchical checkpointing schemes for adjoint computations

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