Abstract
Semidefinite programs derived from the Kalman-Yakubovich-Popov (KYP) lemma are quite common in control and signal processing applications. The programs are often of high dimension which makes them hard or impossible to solve with general-purpose solvers. Here we present a customized preprocessor, KYPD, that utilizes the inherent structure of this particular optimization problem. The key to an efficient implementation is to transform the optimization problem into an equivalent semidefinite program. This equivalent problem has much fewer variables and the matrices in the linear matrix inequality constraints are of low rank. KYPD can use any primal-dual solver for semidefinite programs as an underlying solver.
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.
