Sciweavers

125 search results - page 1 / 25
» Semidefinite representation of convex sets
Sort
View
MP
2010
97views more  MP 2010»
12 years 11 months ago
Semidefinite representation of convex sets
Let S = {x Rn : g1(x) 0,
J. William Helton, Jiawang Nie
CDC
2008
IEEE
291views Control Systems» more  CDC 2008»
13 years 6 months ago
Structured semidefinite representation of some convex sets
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems ...
J. William Helton, Jiawang Nie
SIAMJO
2010
108views more  SIAMJO 2010»
13 years 3 months ago
Exposed Faces of Semidefinitely Representable Sets
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are affine linear combinations of variables is positive semidefinite. Motivated by th...
Tim Netzer, Daniel Plaumann, Markus Schweighofer
CORR
2010
Springer
198views Education» more  CORR 2010»
13 years 1 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
SIAMJO
2000
113views more  SIAMJO 2000»
13 years 4 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel