One of the main developments in optimization over the last 20 years isSemi-Definite Programming. It treats problems which can be expressed as aLinear Matrix Inequality (LMI). Any such problem is necessarily convex,so the determining the scope and range of applicability comes down to thequestion:How much more restricted are LMIs than Convex Matri...
Creator:
Helton, J. William (University of California, San Diego)
Created:
2015-11-05
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.