Completely positive semidefinite rank
An n× n matrix X is called completely positive semidefinite (cpsd) if there exist d× d Hermitian positive semidefinite matrices {Pi}i=1n (for some d≥ 1) such that Xij= Tr (PiPj) , for all i, j∈ { 1 , … , n}. The cpsd-rank of a cpsd matrix is the smallest d≥ 1 for which such a representation is possi...
Saved in:
Main Authors: | Prakash, Anupam, Sikora, Jamie, Varvitsiotis, Antonios, Wei, Zhaohui |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/139101 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Semismooth homeomorphisms and strong stability of semidefinite and Lorentz complementarity problems
by: Pang, J.-S., et al.
Published: (2013) -
A parallel approximation algorithm for positive semidefinite programming
by: Jain, R., et al.
Published: (2013) -
Matrix Completion Models with Fixed Basis Coefficients and Rank Regularized Problems with Hard Constraints
by: MIAO WEIMIN
Published: (2013) -
An alternating direction method for solving convex nonlinear semidefinite programming problems
by: Zhang, S., et al.
Published: (2014) -
Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
by: Hogben, Leslie, et al.
Published: (2017)