Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2016.2
URN: urn:nbn:de:0030-drops-66258
URL: https://drops.dagstuhl.de/opus/volltexte/2016/6625/
Basu, Amitabh ; Dinitz, Michael ; Li, Xin
Computing Approximate PSD Factorizations
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{basu_et_al:LIPIcs:2016:6625,
author = {Amitabh Basu and Michael Dinitz and Xin Li},
title = {{Computing Approximate PSD Factorizations}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)},
pages = {2:1--2:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-018-7},
ISSN = {1868-8969},
year = {2016},
volume = {60},
editor = {Klaus Jansen and Claire Mathieu and Jos{\'e} D. P. Rolim and Chris Umans},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6625},
URN = {urn:nbn:de:0030-drops-66258},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2016.2},
annote = {Keywords: PSD rank, PSD factorizations}
}
| Keywords: | PSD rank, PSD factorizations | |
| Seminar: | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016) | |
| Issue date: | 2016 | |
| Date of publication: | 06.09.2016 |
