Skip to main content

Adjoints for Time-Dependent Optimal Control

  • Conference paper

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 64))

Summary

The use of discrete adjoints in the context of a hard time-dependent optimal control problem is considered. Gradients required for the steepest descent method are computed by code that is generated automatically by the differentiation-enabled NAGWare Fortran compiler. Single time steps are taped using an overloading approach. The entire evolution is reversed based on an efficient checkpointing schedule that is computed by revolve. The feasibility of nonlinear optimization based on discrete adjoints is supported by our numerical results.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berggren, M.: Numerical solution of a flow-control problem: Vorticity reduction by dynamic boundary action. SIAM J. Sci. Comput. 19(3), 829–860 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cockburn, B., Shu, C.: Runge-Kutta discontinuous Galerkin methods for convection-dominated problems. Journal of Scientific Computing 16, 173–261 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Collis, S.S., Joslin, R.D., Seifert, A., Theofilis, V.: Issues in active flow control: theory, control, simulation and experiment. Progress in Aerospace Sciences 40, 237–289 (2004)

    Article  Google Scholar 

  4. Gendler, D., Naumann, U., Christianson, B.: Automatic differentiation of assembler code. In: Proceedings of the IADIS International Conference on Applied Computing, pp. 431–436. IADIS (2007)

    Google Scholar 

  5. Griewank, A.: Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. Optimization Methods and Software 1, 35–54 (1992)

    Article  Google Scholar 

  6. Griewank, A.: Evaluating Derivatives. Principles and Techniques of Algorithmic Differentiation. SIAM (2000)

    Google Scholar 

  7. Griewank, A., Juedes, D., Utke, J.: ADOL-C, a package for the automatic differentiation of algorithms written in C/C++. ACM Trans. Math. Soft. 22, 131–167 (1996)

    Article  MATH  Google Scholar 

  8. Griewank, A., Walther, A.: Revolve: An implementation of checkpointing for the reverse or adjoint mode of computational differentiation. ACM Trans. Math. Software 26, 19–45 (2000)

    Article  MATH  Google Scholar 

  9. Gunzburger, M.D.: Perspectives in Flow Control and Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2002)

    Google Scholar 

  10. Hascoët, L., Naumann, U., Pascual, V.: To-be-recorded analysis in reverse mode automatic differentiation. Future Generation Computer Systems 21, 1401–1417 (2005)

    Article  Google Scholar 

  11. Kim, J., Bewley, T.R.: A linear systems approach to flow control. Annual Review of Fluid Mechanics 39, 383–417 (2007)

    Article  MathSciNet  Google Scholar 

  12. Kubota, K.: A Fortran77 preprocessor for reverse mode automatic differentiation with recursive checkpointing. Optimization Methods and Software 10, 319 – 336 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  13. Maier, M., Naumann, U.: Intraprocedural adjoint code generated by the differentiation-enabled NAGWare Fortran compiler. In: Proceedings of 5th International Conference on Engineering Computational Technology (ECT 2006), pp. 1–19. Civil-Comp Press (2006)

    Google Scholar 

  14. Naumann, U., Maier, M., Riehme, J., Christianson, B.: Automatic first- and second-order adjoints for truncated Newton. In: Proceedings of the Workshop on Computer Aspects of Numerical Algorithms (CANA’07). Wisla, Poland (2007). To appear.

    Google Scholar 

  15. Naumann, U., Riehme, J.: Computing adjoints with the NAGWare Fortran 95 compiler. In: H. Bücker, G. Corliss, P. Hovland, U. Naumann, B. Norris (eds.) Automatic Differentiation: Applications, Theory, and Tools, no. 50 in Lecture Notes in Computational Science and Engineering, pp. 159–170. Springer (2005)

    Google Scholar 

  16. Naumann, U., Riehme, J.: A differentiation-enabled Fortran 95 compiler. ACM Transactions on Mathematical Software 31(4), 458–474 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  17. Spurk, J.H.: Fluid Mechanics. Springer (2007)

    Google Scholar 

  18. Stumm, P., Walther, A., Riehme, J., Naumann, U.: Structure-exploiting automatic differentiation of finite element discretizations. Tech. rep., SPP1253-15-02, Technische Universität Dresden (2007)

    Google Scholar 

  19. Walther, A., Griewank, A.: Advantages of binomial checkpointing for memory-reduced adjoint calculations. In: M. Feistauer, V. Dolejší, P. Knobloch, K. Najzar (eds.) Numerical Mathematics and Advanced Applications, ENUMATH 2003, Prag, pp. 834–843. Springer (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Riehme, J., Walther, A., Stiller, J., Naumann, U. (2008). Adjoints for Time-Dependent Optimal Control. In: Bischof, C.H., Bücker, H.M., Hovland, P., Naumann, U., Utke, J. (eds) Advances in Automatic Differentiation. Lecture Notes in Computational Science and Engineering, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68942-3_16

Download citation

Publish with us

Policies and ethics