AbstractThis paper concerns the cone of positive semidefinite matrices which have zeros in prescribed entries. One of the main purposes is to obtain information and, if possible, describe the ranks of external matrices in such cones in terms of the pattern of prescribed zeros. In particular, we study those patterns for which the ranks of extremal matrices are less than a given number
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k×k real ...
Given are tight upper and lower bounds for the minimum rank among all matrices with a prescribed ze...
AbstractLet Kn be the convex set of n×n positive semidefinite doubly stochastic matrices. We show th...
AbstractThis paper concerns the cone of positive semidefinite matrices which have zeros in prescribe...
Thesis (Ph.D.)--University of Washington, 2014The positive semidefinite (psd) rank of a nonnegative ...
International audienceLet A be an element of the copositive cone C^n. A zero u of A is a nonzero non...
In recent years, semidefinite programming has been an important topic in the area of convex optimiza...
In recent years, semidefinite programming has been an important topic in the area of convex optimiza...
We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetr...
Let M∈R^p×q be a nonnegative matrix. The positive semidefinite rank (psd rank) of M is the smallest ...
AbstractA survey of some general properties of the cone of positive semidefinite matrices, its faces...
Let M∈R[superscript p×q] be a nonnegative matrix. The positive semidefinite rank (psd rank) of M i...
AbstractSeveral inequalities relating the rank of a positive semidefinite matrix with the ranks of v...
AbstractLet E be the set of symmetric matrices in which every entry is 0 or ±1 and each diagonal ent...
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k×k real ...
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k×k real ...
Given are tight upper and lower bounds for the minimum rank among all matrices with a prescribed ze...
AbstractLet Kn be the convex set of n×n positive semidefinite doubly stochastic matrices. We show th...
AbstractThis paper concerns the cone of positive semidefinite matrices which have zeros in prescribe...
Thesis (Ph.D.)--University of Washington, 2014The positive semidefinite (psd) rank of a nonnegative ...
International audienceLet A be an element of the copositive cone C^n. A zero u of A is a nonzero non...
In recent years, semidefinite programming has been an important topic in the area of convex optimiza...
In recent years, semidefinite programming has been an important topic in the area of convex optimiza...
We propose an algorithm for solving optimization problems defined on a subset of the cone of symmetr...
Let M∈R^p×q be a nonnegative matrix. The positive semidefinite rank (psd rank) of M is the smallest ...
AbstractA survey of some general properties of the cone of positive semidefinite matrices, its faces...
Let M∈R[superscript p×q] be a nonnegative matrix. The positive semidefinite rank (psd rank) of M i...
AbstractSeveral inequalities relating the rank of a positive semidefinite matrix with the ranks of v...
AbstractLet E be the set of symmetric matrices in which every entry is 0 or ±1 and each diagonal ent...
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k×k real ...
The positive semidefinite (psd) rank of a polytope is the smallest k for which the cone of k×k real ...
Given are tight upper and lower bounds for the minimum rank among all matrices with a prescribed ze...
AbstractLet Kn be the convex set of n×n positive semidefinite doubly stochastic matrices. We show th...