Multistage approaches for optimal offline checkpointing
From MaRDI portal
(Redirected from Publication:3567013)
Existence theories for optimal control problems involving partial differential equations (49J20) Applications of optimal control and differential games (49N90) Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms (68W40)
Recommendations
- New algorithms for optimal online checkpointing
- Checkpointing schemes for adjoint codes: Application to the meteorological model Meso-NH
- scientific article; zbMATH DE number 2110758
- Reduction of storage requirement by checkpointing for time-dependent optimal control problems in ODEs
- A memory-reduced implementation of the Newton-CG method in optimal control of nonlinear time-dependent PDEs
Cited in
(20)- Reducing memory requirements in scientific computing and optimal control
- Optimal multistage algorithm for adjoint computation
- Reduction of storage requirement by checkpointing for time-dependent optimal control problems in ODEs
- On evaluating higher-order derivatives of the QR decomposition of tall matrices with full column rank in forward and reverse mode algorithmic differentiation
- Storing versus recomputation on multiple DAGs
- Structure exploiting adjoints for finite element discretizations
- New algorithms for optimal online checkpointing
- Memory-efficient implementation of Riccati approach for time-dependent optimal control problems in ODEs
- Memory efficient approaches of second order for optimal control problems.
- Approximately uniform online checkpointing with bounded memory
- scientific article; zbMATH DE number 2110758 (Why is no real title available?)
- Adjoint Code Design Patterns
- Parallel reverse time integration and reduced order models
- \texttt{PETSc TSAdjoint}: a discrete adjoint ODE solver for first-order and second-order sensitivity analysis
- Automated calculation of higher order partial differential equation constrained derivative information
- Periodicity in optimal hierarchical checkpointing schemes for adjoint computations
- The Data-Flow Equations of Checkpointing in Reverse Automatic Differentiation
- A matrix-free exact Newton method
- Reducing memory requirements of unsteady adjoint by synergistically using check-pointing and compression
- On nonlinear transitions, minimal seeds and exact solutions for the geodynamo
This page was built for publication: Multistage approaches for optimal offline checkpointing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567013)
