Abstract

The approximate solution of optimization and control problems for systems governedby the Stokes equations is considered. Modern computational techniques for such problems are predominantly based on the application of the Lagrange multiplier rule, while penalty formulations, even though widely used in other settings, have not enjoyed the same level of popularity for this class of problems. A discussion is provided that explains why naively defined penalty methods may not be practical. Then, practical penalty methods are defined using methodologies associated with modern least-squares finite-element methods. The advantages, with respect to efficiency, of penalty/leasts-squares methods for optimal control problems compared to methods based on Lagrange multipliers are highlighted. A tracking problem for the Stokes system is used for illustrative purposes.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.