Abstract
This paper presents an iterative penalty function method for solving rank-constrained linear matrix inequality (LMI) problems and illustrates its application to reduced-order output feedback stabilization. We propose a penalized objective function to replace the rank condition, so that a solution to the original nonconvex LMI feasibility problem can be obtained by solving a series of convex LMI optimization subproblems. Numerical experiments were performed to demonstrate the proposed method.
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.
