I will discuss the characterization of convex sets in mwhich can be represented by Linear Matrix Inequalities, i.e., as feasiblesets of semidefinite programmes. There is a simple necessary condition,called rigid convexity, which has been shown to be sufficient for sets inthe plane and is conjectured to be sufficient (in a somewhat weakened sense...
Creator:
Vinnikov, Victor (Ben Gurion University of the Negev)
Created:
2007-01-19
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
MAES project #18-045, "Modifying Milk Fat Composition for Improved Manufacturing Qualities and Consumer Acceptability," and 18-039, "Enhancing Food Safety Through Control of Food-Borne Disease Agents".
Creator:
Hansen, David L., 1952-
Created:
2005-04-19
Contributed By:
University of Minnesota, Minnesota Agricultural Experiment Station.
MAES project #18-045, "Modifying Milk Fat Composition for Improved Manufacturing Qualities and Consumer Acceptability," and 18-039, "Enhancing Food Safety Through Control of Food-Borne Disease Agents".
Creator:
Hansen, David L., 1952-
Created:
2005-04-19
Contributed By:
University of Minnesota, Minnesota Agricultural Experiment Station.