Year-end Sale % OFF 
Abstract
Abstract This paper concerns with the overbounding method for solving the bilinear matrix inequality (BMI) problem. The overbounding method is essentially the same as the difference of convex optimization approach and the inner approximation method. The unified view of these methods is provided. This paper also proposes a new overbounding algorithm based on the less conservative overbounding approximation and the matrix decomposition.
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.
