Abstract
In this chapter a randomized ellipsoid algorithm is described that can be used for finding solutions to robust Linear Matrix Inequality (LMI) problems. The iterative algorithm enjoys the property that the convergence speed is independent on the number of uncertain parameters. Other advantages, as compared to the deterministic algorithms, are that the uncertain parameters can enter the LMIs in a general nonlinear way, and that very large systems of LMIs can be treated. Given an initial ellipsoid that contains the feasibility set, the proposed approach iteratively generates a sequence of ellipsoids with decreasing volumes, all containing the feasibility set. A method for finding an initial ellipsoid is also proposed based on convex optimization. For an important subclass of problems, namely for constrained robust least squares problems, analytic expressions are derived for the initial ellipsoid that could replace the convex optimization. The approach is finally applied to the problem of robust Kalman filtering.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.