Advertisement

Descent-Penalty Methods for Relaxed Nonlinear Elliptic Optimal Control Problems

  • Ion Chryssoverghi
  • Juergen Geiser
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4818)

Abstract

An optimal control problem is considered, described by a second order elliptic partial differential equation, jointly nonlinear in the state and control variables, with high monotone nonlinearity in the state, and with control and state constraints. Since no convexity assumptions are made, the problem may have no classical solutions, and so it is reformulated in the relaxed form. The relaxed problem is discretized by a Galerkin finite element method for state approximation, while the controls are approximated by elementwise constant relaxed ones. The first result is that relaxed accumulation points of sequences of admissible and extremal discrete controls are admissible and extremal for the continuous relaxed problem. We then propose a mixed conditional descent-penalty method, applied to a fixed discrete relaxed problem, and also a progressively refining version of this method that reduces computing time and memory. We show that accumulation points of sequences generated by the fixed discretization (resp. progressively refining) method are admissible and extremal for the discrete (resp. continuous) relaxed problem. Numerical examples are given. This paper proposes relaxed discretization and optimization methods instead of the corresponding classical methods presented in [5]. Considered here problems are with not necessarily convex control constraint sets, and with state constraints and cost functionals depending also on the state gradient. Also, the results of Sections 1 and 2 generalize those of [8] w.r.t. the assumptions made.

Keywords

Optimal Control Problem State Constraint Young Measure Classical Control Discrete Control 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bartels, S.: Adaptive approximation of Young measure solution in scalar non-convex variational problems. SIAM J. Numer. Anal. 42, 505–629 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bonnans, J., Casas, E.: Un principe de Pontryagine pour le contrôle des systèmes semilineaires elliptiques. J. Diff. Equat. 90, 288–303 (1991)CrossRefzbMATHGoogle Scholar
  3. 3.
    Cartensen, C., Roubíc̆ek, T.: Numerical approximation of Young measure in nonconvex variational problems. Numer. Math. 84, 395–415 (2000)Google Scholar
  4. 4.
    Casas, E.: The relaxation theory applied to optimal control problems of semilinear elliptic equations. In: Proc. of the 17th Conf. on Systems, Modeling and Optimization, Prague, 1995, Chapman and Hall, Boca Raton (1996)Google Scholar
  5. 5.
    Chryssoverghi, I.: Mixed discretization-optimization methods for nonlinear elliptic optimal control problems. In: Boyanov, T., et al. (eds.) NMA 2006. LNCS, vol. 4310, pp. 287–295. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Chryssoverghi, I., et al.: Mixed Frank-Wolfe penalty method with applications to nonconvex optimal control problems. J. Optim. Theory Appl. 94, 311–334 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Chryssoverghi, I., Coletsos, J., Kokkinis, B.: Discretization methods for nonconvex optimal control problems with state constraints. Numer. Funct. Anal. Optim. 26, 321–348 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chryssoverghi, I., Kokkinis, B.: Discretization of nonlinear elliptic optimal control problems. Syst. Control Lett. 22, 227–234 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Lions, J.-L.: Certain methods of solution of nonlinear boundary value problems, English Translation, Holt, Rinehart and Winston New York (1972)Google Scholar
  10. 10.
    Mach, J.: Numerical solution of a class of nonconvex variational problems by SQP. Numer. Funct. Anal. Optim. 23, 573–587 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Matache, A.-M., Roubíc̆ek, T., Schwab, C.: Higher-order convex approximations of Young measures in optimal control. Adv. Comp. Math. 19, 73–79 (2003)Google Scholar
  12. 12.
    Roubíc̆ek, T.: Relaxation in Optimization Theory and Variational Calculus. Walter de Gruyter, Berlin (1997)Google Scholar
  13. 13.
    Warga, J.: Optimal control of Differential and Functional Equations. Academic Press, New York (1972)zbMATHGoogle Scholar
  14. 14.
    Warga, J.: Steepest descent with relaxed controls. SIAM J. Control Optim., 674–682 (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ion Chryssoverghi
    • 1
  • Juergen Geiser
    • 2
  1. 1.Department of MathematicsNational Technical University of AthensAthensGreece
  2. 2.Department of MathematicsHumboldt UniversityBerlinGermany

Personalised recommendations