相关论文: On semidefinite programming characterizations of t…
We give a semidefinite programming characterizations of the numerical radius and its dual norm for quaternionic matrices. We show that the computation of the numerical radius and its dual norm within $\varepsilon$ precision are polynomially…
The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably much…
We make an experimental comparison of methods for computing the numerical radius of an $n\times n$ complex matrix, based on two well-known characterizations, the first a nonconvex optimization problem in one real variable and the second a…
We give a semidefinite programming characterization of the Crawford number. We show that the computation of the Crawford number within $\varepsilon$ precision is computable in polynomial time in the data and $|\log \varepsilon |$.
It is known that one can solve semidefinite programs to within fixed accuracy in polynomial time using the ellipsoid method (under some assumptions). In this paper it is shown that the same holds true when one uses the short-step, primal…
We consider a version of geometric programming problem consisting in minimizing a function given by the maximum of finitely many log-Laplace transforms of discrete nonnegative measures on a Euclidean space. Under a coerciveness assumption,…
The recent decade has witnessed a surge of research in modelling and computing from two-way data (matrices) to multiway data (tensors). However, there is a drastic phase transition for most tensor optimization problems when the order of a…
We show that a certain tensor norm, the completely bounded norm, can be expressed by a semidefinite program. This tensor norm recently attracted attention in the field of quantum computing, where it was used by Arunachalam, Bri\"{e}t and…
We discuss how semidefinite programming can be used to determine the second-order density matrix directly through a variational optimization. We show how the problem of characterizing a physical or N -representable density matrix leads to…
We show that the spectral norm of a $d$-mode real or complex symmetric tensor in $n$ variables can be computed by finding the fixed points of the corresponding polynomial map. For a generic complex symmetric tensor the number of fixed…
The matrix spectral and nuclear norms appear in enormous applications. The generalizations of these norms to higher-order tensors is becoming increasingly important but unfortunately they are NP-hard to compute or even approximate. Although…
In this paper, we study the problem of approximately computing the product of two real matrices. In particular, we analyze a dimensionality-reduction-based approximation algorithm due to Sarlos [1], introducing the notion of nuclear rank as…
The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms may be both calculated and verified, and gives alternate…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
Given symmetric matrices $A_0, A_1, \ldots, A_n$ of size $m$ with rational entries, the set of real vectors $x = (x_1, \ldots, x_n)$ such that the matrix $A_0 + x_1 A_1 + \cdots + x_n A_n$ has non-negative eigenvalues is called a…
We develop a practical approach to semidefinite programming (SDP) that includes the von Neumann entropy, or an appropriate variant, as a regularization term. In particular we solve the dual of the regularized program, demonstrating how a…
Positive semidefinite programs are an important subclass of semidefinite programs in which all matrices involved in the specification of the problem are positive semidefinite and all scalars involved are non-negative. We present a parallel…
In this article, we show that the algebraic degree in semidefinite programming can be expressed in terms of the coefficient of a certain monomial in a doubly symmetric polynomial. This characterization of the algebraic degree allows us to…