Answers are grounded in this paper and cite their sources.
Consider a convex set [Formula: see text], where G(x) is a symmetric matrix whose every entry is a polynomial or rational function, π β« β n is a domain on which G(x) is defined, and [Formula: see text] means G(x) is positive semidefinite. The set S is called semidefinite representable if it equals the projection of a higher dimensional set that is defined by a linear matrix inequality (LMI). This paper studies sufficient conditions guaranteeing semidefinite representability of S. We prove that S is semidefinite representable in the following cases: (i) π = β n , G(x) is a matrix polynomial and matrix sos-concave; (ii) π is compact convex, G(x) is a matrix polynomial and strictly matrix concave on π (iii) G(x) is a matrix rational function and q-module matrix concave on π. Explicit constructions of semidefinite representations are given. Some examples are illustrated.
No takes yet. Share an insight, caveat, or question.
Jiawang Nie (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: