2026-07-25T06:06:23Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6625 2024-03-06T10:38:32Z ddc:004 open_access

Computing Approximate PSD Factorizations Basu, Amitabh Dinitz, Michael Li, Xin PSD rank PSD factorizations 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Amitabh Basu and Michael Dinitz and Xin Li 2016 Is Part Of LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.APPROX-RANDOM.2016.2 urn:nbn:de:0030-drops-66258 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016.2 eng https://creativecommons.org/licenses/by/3.0/legalcode