Skip to main content
SpringerLink
Log in

Adjoint concepts for the optimal control of Burgers equation

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Adjoint techniques are a common tool in the numerical treatment of optimal control problems. They are used for efficient evaluations of the gradient of the objective in gradient-based optimization algorithms. Different adjoint techniques for the optimal control of Burgers equation with Neumann boundary control are studied. The methods differ in the point in the numerical algorithm at which the adjoints are incorporated. Discretization methods for the continuous adjoint are discussed and compared with methods applying the application of the discrete adjoint. At the example of the implicit Euler method and the Crank Nicolson method it is shown that a discretization for the adjoint problem that is adjoint to the discretized optimal control problem avoids additional errors in gradient-based optimization algorithms. The approach of discrete adjoints coincides with that of automatic differentiation tools (AD) which provide exact gradient calculations on the discrete level.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Alt, “The Lagrange-Newton method for infinite-dimensional optimization problems,” Numer. Func. Anal. and Optim., vol. 11, pp. 201–224, 1990.

    MathSciNet  Google Scholar 

  2. C. Bendtsen and O. Stauning, “FADBAD, a flexible C++ package for automatic differentiation,” Technical University of Denmark, IMM, Technical Report IMM-REP-1996-17 (1996).

  3. G. Biros and O. Ghattas, “Parallel Lagrange-Newton-Krylov-Schur methods for PDE-constrained optimization. Part I: the Krylov-Schur solver,” SIAM Journal on Scientific Computing, to appear.

  4. C. Bischof, A. Carle, P. Khademi, A. Maurer, and P. Hovland, ADIFOR 2.0 User’s Guide, ANL. ANL/MCS-TM-192, 1994.

  5. P.G. Ciarlet, Introduction to Numerical Linear Algebra and Optimization, Cambridge Univers. Press, 1989.

  6. R. Dautray and J.-L. Lions, Mathematical Analysis and Numerical Methods for Science and Technology. Volume 5: Evolution Problems I, Springer Verlag, 1992.

  7. R. Giering and T. Kaminski, “Recies for adjoint code construction,” ACM Trans. Math. Software, vol. 24, pp. 437–474, 1998.

    Article  Google Scholar 

  8. R. Griesse and A. Walther, “Evaluating gradients in optimal control—continuous adjoints versus automatic differentiation,” J. Optim. Theory and Appl.(JOTA), vol. 122, no. 1, pp. 63–86, 2004.

    Article  MathSciNet  Google Scholar 

  9. A. Griewank, “On automatic differentiation,” in Mathematical Programming: Recent Developments and Applications, (Eds.), M. Iri and K. Tanabe, Kluwer Academic Publishers, 1989, pp 83–107.

  10. A. Griewank, “Evaluating derivatives: Principles and techniques of algorithmic differentiation,” Frontiers in appl. math vol. 19, 2000.

  11. A. Griewank, D. Juedes, and J. Utke, “ADOL–C, a package for the automatic differentiation of algorithms written in C/C++,” ACM Trans. Math. Soft., vol. 22, pp. 131–167, 1996.

    Article  Google Scholar 

  12. A. Griewank and A. Walther, “Revolve: An implementation of checkpointing for the reverse or adjoint mode of computational differentiation,” TOMS, vol. 26, no. 1, 2000.

  13. A. Griewank and A. Walther, “Applying the checkpointing routine treeverse to discretizations of Burgers’ equation,” Lect. Notes Comput. Sci.and Engin. 8: in High Performance Scientific and Engineering Computing, H.-J. Bungartz, F. Durst, and C. Zenger (Eds.) Springer Berlin Heidelberg, 1999.

  14. Ch. Grossmann and A. Noack, “Linearizations and adjoints of operator equations – constructions and selected applications,” Preprint MATH-NM-08-01, TU Dresden, 2001.

  15. Ch. Grossmann and H.-G. Roos, “Numerik partieller Differentialgleichungen,” Teubner, 1992.

  16. M. Hinze, “Optimal and instantaneous control of the instationary Navier-Stokes equations,” Habilitationsschrift, Fachbereich Mathematik, Technische Universität Berlin, 1999.

  17. M. Hinze and S. Volkwein, “Analysis of instantaneous control for the Burgers equation,” Nonlinear Anal. TMA 50A, no. 1, pp. 1–26, 2002.

  18. D. Keyes, P. Hovland, L. McInnes, and W. Samyono, “Using automatic differentiation for second-order matrix-free methods in pde-constrained optimization,” in Automatic Differentiation of Algorithms: From Simulation to Optimization, G. Corliss, C. Faure, A. Griewank, L. Hascoet, and U. Naumann (Eds.), Springer, New York, 2001.

    Google Scholar 

  19. K. Kunisch and S. Volkwein, “Control of Burgers’ equation by a reduced order approach using proper orthogonal decomposition,” J. Optim. Theory and Appl, vol. 102, pp. 345–371, 1999.

    Article  MathSciNet  Google Scholar 

  20. J.-M. Lellouche, J.-L. Devenon, and I. Dekeyser, “Boundary control of Burgers’ equation—a numerical approach,” Comput Math. Applic., vol. 28, no. 5, pp. 33–44, 1994.

    Article  MathSciNet  Google Scholar 

  21. Y. Leredde, J.-M. Lellouche, J.-L. Devenon, and I. Dekeyser, “On initial, boundary conditions and viscosity coefficient control for Burgers’ equation,” Int. J. Numer. Meth. Fluids, vol. 28, pp. 113–128, 1998.

    Article  MathSciNet  Google Scholar 

  22. R. Temam, Navier-Stokes Equations,” Studies in Mathematics and its Applications. North-Holland, 1979.

  23. F. Tröltzsch, “On the Lagrange-Newton-SQP method for the optimal control of semilinear parabolic equations,” SIAM J. Control Optimization, vol. 38, no. 1, pp. 294–312, 1999.

    Article  Google Scholar 

  24. F. Tröltzsch, and S. Volkwein, “The SQP method for control constrained optimal control of the Burgers equation,” ESAIM: Control, Optimisation and Calculus of Variations, vol. 6, pp. 649–674, 2001.

    Article  MathSciNet  Google Scholar 

  25. A. Verma, “ADMAT: An automatic differentiation and MATLAB interface toolbox,” in Object-Oriented Methods for Interoperable Scientific and Engineering Computing, M. Henderson, C. Anderson, and S. Lyons (Eds.), SIAM, 1999, pp. 174–183.

  26. S. Volkwein, “Second order conditions for boundary control problems of the Burgers equation,” Control and Cybernatics, vol. 30, pp. 249–278, 2001.

    Google Scholar 

  27. S. Volkwein, “Mesh-independence of an augmented Lagrangian-SQP method in Hilbert spaces and control problems for the Burgers equation,” Diss. at the University of Technology Berlin, 1997.

Download references

Author information

Authors and Affiliations

  1. Institute of Scientific Computing, Technische Universität Dresden, D-01062, Dresden, Germany

    Antje Noack & Andrea Walther

Authors
  1. Antje Noack
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrea Walther
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Antje Noack.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Noack, A., Walther, A. Adjoint concepts for the optimal control of Burgers equation. Comput Optim Applic 36, 109–133 (2007). https://doi.org/10.1007/s10589-006-0393-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-006-0393-7

Keywords

Search

Navigation