Related papers: Semidefinite Representation of Convex Sets

We study the closure of the projection of the (nonconvex) cone of rank restricted positive semidefinite matrices onto subsets of the matrix entries. This defines the feasible sets for semidefinite completion problems with restrictions on…

We propose the first general and scalable framework to design certifiable algorithms for robust geometric perception in the presence of outliers. Our first contribution is to show that estimation using common robust costs, such as truncated…

Let $M$ be a closed hyperbolic manifold containing a totally geodesic hypersurface $S$, and let $N$ be a closed Riemannian manifold homotopy equivalent to $M$ with sectional curvature bounded above by $-1$. Then it follows from the work of…

We study the convex relaxation of a polynomial optimization problem, maximizing a product of linear forms over the complex sphere. We show that this convex program is also a relaxation of the permanent of Hermitian positive semidefinite…

In recent years, semi-supervised learning (SSL) has shown tremendous success in leveraging unlabeled data to improve the performance of deep learning models, which significantly reduces the demand for large amounts of labeled data. Many SSL…

A matrix convex set is a set of the form $\mathcal{S} = \cup_{n\geq 1}\mathcal{S}_n$ (where each $\mathcal{S}_n$ is a set of $d$-tuples of $n \times n$ matrices) that is invariant under UCP maps from $M_n$ to $M_k$ and under formation of…

Convex relaxation methods are powerful tools for studying the lowest energy of many-body problems. By relaxing the representability conditions for marginals to a set of local constraints, along with a global semidefinite constraint, a…

Using the decomposition of semimagic squares into the associated and balanced symmetry types as a motivation, we introduce an equivalent representation in terms of block-structured matrices. This block representation provides a way of…

Let $G$ be a locally convex Lie group and $\pi:G \to \mathrm{U}(\mathcal{H})$ be a continuous unitary representation. $\pi$ is called smooth if the space of $\pi$-smooth vectors $\mathcal{H}^\infty\subset \mathcal{H}$ is dense. In this…

The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…

The induced representation ${\rm Ind}_H^GS$ of a locally compact group $G$ is the unitary representation of the group $G$ associated with unitary representation $S:H\rightarrow U(V)$ of a subgroup $H$ of the group $G$. Our aim is to develop…

We study the problem of representing multivariate polynomials with rational coefficients, which are nonnegative and strictly positive on finite semialgebraic sets, using rational sums of squares. We focus on the case of finite semialgebraic…

We study the multiplicity $b_S(n)$ of the trivial representation in the symmetric group representations $\beta_S$ on the (top) homology of the rank-selected partition lattice $\Pi_n^S$. We break the possible rank sets $S$ into three cases:…

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

Let $\mathfrak g$ be a locally finite split simple complex Lie algebra of type $A_J$, $B_J$, $C_J$ or $D_J$ and $\mathfrak h \subseteq \mathfrak g$ be a splitting Cartan subalgebra. Fix $D \in \mathrm{der}(\mathfrak g)$ with $\mathfrak h…

Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc.…

Following G. Gr\"atzer and E. Knapp (2007), a slim semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice. An SPS lattice is a slim rectangular lattice if it has exactly two doubly…

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

We develop tractable convex relaxations for rank-constrained quadratic optimization problems over $n \times m$ matrices, a setting for which tractable relaxations are typically only available when the objective or constraints admit spectral…

Random projection, a dimensionality reduction technique, has been found useful in recent years for reducing the size of optimization problems. In this paper, we explore the use of sparse sub-gaussian random projections to approximate…