Abstract
Problems that can be reduced to polynomial and parametrized linear matrix inequalities are considered. Such problems arise, for example, in control theory. Well-known methods for their solution based on a search for nonnegative polynomials scale poorly and require significant computational resources. An approach based on systematic transformations of the problem under study to a form that can be addressed with simpler methods is presented.
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: Computational Mathematics and Mathematical Physics
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.
