Abstract
The linear quadratic optimal control problem under quadratic constraints is an optimization problem over a generally non-convex set. Yakubovich [8] and Megretski [4] have studied this problem, and they show how it may be translated into a two-stage, convex optimization problem. In this paper we study the linear quadratic control problem under quadratic constraints for generalized first-order systems. As in the state-space case the linear quadratic control problem without quadratic constraints may be solved in terms of a linear matrix inequality. Subsequently, we use the results from [8] to derive a linear matrix inequality characterizing the linear quadratic optimal behaviour under quadratic constraints.
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.
