Abstract
This paper treats the computational method of the optimal H∞ model order reduction (MOR) problem of linear time-invariant (LTI) systems. Optimal solution of MOR problem of LTI systems can be obtained by solving the LMIs feasibility coupling with a rank inequality constraint, which makes the solutions much harder to be obtained. In this paper, we show that the rank inequality constraint can be formulated as a linear rank function equality constraint. Properties of the linear rank function are discussed. We present an iterative algorithm based on augmented Lagrangian method by replacing the rank inequality with the linear rank function. Convergence analysis of the algorithm is given, which is distinct to the now available heuristic methods. Numerical experiments for the MOR problems of continuous LTI system illustrate the practicality of our method.
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.
