Abstract
This paper deals with the design of efficient algorithms for solving analysis problems formulated in the integral quadratic constraint (IQC) framework. The oracle for the discrete-time IQC problem is coupled with the analytic center cutting plane method (ACCPM), and the implementation of the ACCPM is customized to leverage promising features of the oracle such as the possibility of generating strictly separating hyper planes between the candidate solution and feasible set and the possibility of generating more than one separating hyper plane. Such customizations may be needed if the ACCPM is to be used as part of recursive IQC synthesis algorithms for practical problems. Numerical examples are generated to compare various versions of the ACCPM, namely, with single center cuts, single deep cuts, and two center cuts.
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.
