Skip to main content

Progressively Refining Discrete Gradient Projection Method for Semilinear Parabolic Optimal Control Problems

  • Conference paper
Numerical Analysis and Its Applications (NAA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3401))

Included in the following conference series:

  • 2599 Accesses

Abstract

We consider an optimal control problem defined by semilinear parabolic partial differential equations, with convex control constraints. Since this problem may have no classical solutions, we also formulate it in relaxed form. The classical problem is then discretized by using a finite element method in space and a theta-scheme in time, where the controls are approximated by blockwise constant classical ones. We then propose a discrete, progressively refining, gradient projection method for solving the classical, or the relaxed, problem. We prove that strong accumulation points (if they exist) of sequences generated by this method satisfy the weak optimality conditions for the continuous classical problem, and that relaxed accumulation points (which always exist) satisfy the weak optimality conditions for the continuous relaxed problem. Finally, numerical examples are given.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chryssoverghi, I.: Nonconvex optimal control problems of nonlinear monotone parabolic systems. Systems Control Lett. 8, 55–62 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chryssoverghi, I., Bacopoulos, A.: Approximation of relaxed nonlinear parabolic optimal control problems. J. Optim. Theory Appl. 77(1), 31–50 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chryssoverghi, I., Bacopoulos, A., Kokkinis, B., Coletsos, J.: Mixed Frank-Wolfe penalty method with applications to nonconvex optimal control problems. JOTA 94(2), 311–334 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Chryssoverghi, I., Coletsos, J., Kokkinis, B.: Discrete relaxed method for semilinear parabolic optimal control problems. Control Cybernet 28(2), 157–176 (1999)

    MATH  MathSciNet  Google Scholar 

  5. Polak, E.: Optimization: Algorithms and Consistent Approximations. Springer, Berlin (1997)

    MATH  Google Scholar 

  6. Roubic̆ek, T.: A convergent computational method for constrained optimal relaxed control problems. Control Cybernet 69, 589–603 (1991)

    Google Scholar 

  7. Roubic̆ek, T.: Relaxation in Optimization Theory and Variational Calculus. Walter de Gruyter, Berlin (1997)

    Google Scholar 

  8. Warga, J.: Optimal Control of Differential and Functional Equations. Academic Press, New York (1972)

    MATH  Google Scholar 

  9. Warga, J.: Steepest descent with relaxed controls. SIAM J. Control 15(4), 674–682 (1977)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chryssoverghi, I. (2005). Progressively Refining Discrete Gradient Projection Method for Semilinear Parabolic Optimal Control Problems. In: Li, Z., Vulkov, L., Waśniewski, J. (eds) Numerical Analysis and Its Applications. NAA 2004. Lecture Notes in Computer Science, vol 3401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31852-1_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31852-1_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24937-5

  • Online ISBN: 978-3-540-31852-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics