Abstract
A method for solving convex optimization problems in Hilbert spaces, based on the principle of goal coordination, is described. This general approach is then applied to a linear quadratic control problem, which is assumed to have a special structure. The arising informal problems of smaller dimension and without dynamics must be solved several times. The method is illustrated by an example.
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 callMore From: Mathematische Operationsforschung und Statistik. Series Optimization
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.
