Computing approximate PSD factorizations
Data Structures and Algorithms
2016-02-25 v1 Optimization and Control
Abstract
We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error. The main ingredient is an exact factorization algorithm when the rows and columns of the factors are constrained to lie in a general polyhedron. This strictly generalizes nonnegative matrix factorizations which can be captured by letting this polyhedron to be the nonnegative orthant.
Cite
@article{arxiv.1602.07351,
title = {Computing approximate PSD factorizations},
author = {Amitabh Basu and Michael Dinitz and Xin Li},
journal= {arXiv preprint arXiv:1602.07351},
year = {2016}
}
Comments
10 pages