Abstract
The paper provides an overview on necessary and, whenever available, on sufficient conditions of optimality for optimal control problems with differential-algebraic equations (DAEs) and on numerical approximation techniques. Local and global minimum principles of Pontryagin type are discussed for convex linear-quadratic optimal control problems and for non-convex problems. The main steps for the derivation of such conditions will be explained. The basic working principles of different approaches towards the numerical solution of DAE optimal control problems are illustrated for direct shooting methods, full discretization techniques, projected gradient methods, and Lagrange–Newton methods in a function space setting.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
