University of Cambridge > Talks.cam > CUED Control Group Seminars > Convex Matrix Inequalities vs Linear Matrix Inequalities

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Convex Matrix Inequalities vs Linear Matrix Inequalities

Download to your calendar using vCal

If you have a question about this talk, please contact Dr Guy-Bart Stan .

A substantial advance in optimization starting in the 1990’s was the realization that problems in many areas, like linear system control, combinatorics, statistics convert directly to matrix inequalities, abbreviated MIs, of which by dent of great cleverness some convert to Linear Matrix Inequalities, LMI ’s. A basic question is: which Matrix Inequalities are in fact Linear Matrix Inequalities? Clearly, LMIs are convex, but what about the converse?

How much more restricted are LMIs than Convex MIs?

There is getting to be a reasonable road map to this problem with much left to be proved. It involves use and development of techniques from areas like functional analysis, real algebraic geometry (polynomial inequalities) and matrix theory. In this talk we give results and conjectures on the answer to the LMI vs convexity question.

This talk is part of the CUED Control Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

MAA Digital Lab Doble riotType the title of a new list hereDouble OPdA, Mill Lane

Other talks

Royal Papworth Hospital and Acute Medicine Online Causal Inference Seminar Title to be confirmed Title to be confirmed Topology of the Ritz energy landscape Animating urbanism: the demotic multiplicities of seeing cities digitally
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity