Related papers: Semidefinite Representation of Convex Sets
Many problems of theoretical and practical interest involve finding a convex or concave function. For instance, optimization problems such as finding the projection on the convex functions in $H^k(\Omega)$, or some problems in economics. In…
An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum eigenvalue function on an affine space of symmetric…
In this work we study the existence of surjective Nash maps between two given semialgebraic sets ${\mathcal S}$ and ${\mathcal T}$. Some key ingredients are: the irreducible components ${\mathcal S}_i^*$ of ${\mathcal S}$ (and their…
A unitary representation of a, possibly infinite dimensional, Lie group $G$ is called semibounded if the corresponding operators $i\dd\pi(x)$ from the derived representation are uniformly bounded from above on some non-empty open subset of…
Let $H$ be an infinite dimensional separable Hilbert space, $B(H)$ the $C^*$-algebra of all bounded linear operators on $H,$ $U(B(H))$ the unitary group of $B(H)$ and ${\cal K}\subset B(H)$ the ideal of compact operators. Let $G$ be a…
The matrix logarithm, when applied to Hermitian positive definite matrices, is concave with respect to the positive semidefinite order. This operator concavity property leads to numerous concavity and convexity results for other matrix…
We study the problem of maximizing the geometric mean of $d$ low-degree non-negative forms on the real or complex sphere in $n$ variables. We show that this highly non-convex problem is NP-hard even when the forms are quadratic and is…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
We consider several classes of highly important semidefinite optimization problems that involve both a convex objective function (smooth or nonsmooth) and additional linear or nonlinear smooth and convex constraints, which are ubiquitous in…
A unitary representation of a, possibly infinite dimensional, Lie group G is called semi-bounded if the corresponding operators id\pi(x) from the derived representations are uniformly bounded from above on some non-empty open subset of the…
This paper studies the representations of a non-negative polynomial $f$ on a non-compact semi-algebraic set $K$ modulo its critical ideal. Under the assumptions that the semi-algebraic set $K$ is regular and $f$ satisfies the boundary…
Let $A$ be a commutative unital $\mathbb{R}$-algebra and let $\rho$ be a seminorm on $A$ which satisfies $\rho(ab)\leq\rho(a)\rho(b)$. We apply T. Jacobi's representation theorem to determine the closure of a $\sum A^{2d}$-module $S$ of $A$…
In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends…
In this paper, we generalize the chance optimization problems and introduce constrained volume optimization where enables us to obtain convex formulation for challenging problems in systems and control. We show that many different problems…
Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplines. This paper investigates the application of the…
We develop a practical semidefinite programming (SDP) facial reduction procedure that utilizes computationally efficient approximations of the positive semidefinite cone. The proposed method simplifies SDPs with no strictly feasible…
In this work, we consider the low rank decomposition (SDPR) of general convex semidefinite programming problems (SDP) that contain both a positive semidefinite matrix and a nonnegative vector as variables. We develop a rank-support-adaptive…
Let K, K' be convex cones residing in finite-dimensional real vector spaces E, E'. An element in the tensor product E \otimes E' is K \otimes K'-separable if it can be represented as finite sum \sum_l x_l \otimes x'_l with x_l \in K and…
We study the problem of estimating a low-rank positive semidefinite (PSD) matrix from a set of rank-one measurements using sensing vectors composed of i.i.d. standard Gaussian entries, which are possibly corrupted by arbitrary outliers.…
We continue our study of topological partial *-algebras, focusing our attention to *-semisimple partial *-algebras, that is, those that possess a {multiplication core} and sufficiently many *-representations. We discuss the respective roles…