We give explicit polynomial-sized (in n and k) semidefinite representations of the hyperbolicity cones associated with the elementary symmetric polynomials of degree k in n variables. These convex cones form a family of non-polyhedral outer approximations of the non-negative orthant that preserve low-dimensional faces while successively discarding high-dimensional faces. More generally we construct explicit semidefinite representations (polynomial-sized in k,m, and n) of the hyperbolicity cones associated with kth directional derivatives of polynomials of the form p(x)=det(∑[superscript n][subscript i=1]A[subscript i]x[subscript i]) where the A[subscript i] are m×m symmetric matrices. These convex cones form an analogous family of outer a...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
We give explicit polynomial-sized (in n and k) semidefinite representations of the hyperbol-icity co...
We give explicit polynomial-sized (in n and k) semidefinite representations of the hyperbol-icity co...
Abstract. Hyperbolic polynomials are real polynomials whose real hypersurfaces are max-imally nested...
Real algebraic geometry has a long and beautiful history going back to the 1800s. It is the study o...
Real algebraic geometry has a long and beautiful history going back to the 1800s. It is the study o...
Let $\mathcal{S}_+^n \subset \mathcal{S}^n$ be the cone of positive semi-definite matrices as a subs...
We show that the closed convex hull of any one-dimensional semialgebraic subset of $\mathbb{R}^n$ is...
International audienceLet S^n_+⊂S^n be the cone of positive semi-definite matrices as a subset of th...
International audienceLet S^n_+⊂S^n be the cone of positive semi-definite matrices as a subset of th...
I will survey some topics about hyperbolic polynomials and their determinantal representations, and...
Abstract. We study metric properties of the cone of homogeneous nonnegative multi-variate polynomial...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
We give explicit polynomial-sized (in n and k) semidefinite representations of the hyperbol-icity co...
We give explicit polynomial-sized (in n and k) semidefinite representations of the hyperbol-icity co...
Abstract. Hyperbolic polynomials are real polynomials whose real hypersurfaces are max-imally nested...
Real algebraic geometry has a long and beautiful history going back to the 1800s. It is the study o...
Real algebraic geometry has a long and beautiful history going back to the 1800s. It is the study o...
Let $\mathcal{S}_+^n \subset \mathcal{S}^n$ be the cone of positive semi-definite matrices as a subs...
We show that the closed convex hull of any one-dimensional semialgebraic subset of $\mathbb{R}^n$ is...
International audienceLet S^n_+⊂S^n be the cone of positive semi-definite matrices as a subset of th...
International audienceLet S^n_+⊂S^n be the cone of positive semi-definite matrices as a subset of th...
I will survey some topics about hyperbolic polynomials and their determinantal representations, and...
Abstract. We study metric properties of the cone of homogeneous nonnegative multi-variate polynomial...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...
Semidefinite programming concerns the problem of optimizing a linear function over a section of the ...