Computing approximate PSD factorizations

8 years 7 months ago

Download www.ams.jhu.edu

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.

Amitabh Basu, Michael Dinitz, Xin Li 0006

Real-time Traffic

CORR 2016 | Education |

claim paper

» MMSE based noise PSD tracking with low complexity

» Langevin and hessian with fisher approximation stochastic sampling for parameter estimatio...

» Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations

» Constant factor approximation algorithm for the knapsack median problem

» Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

» LowRank Kernel Matrix Factorization for LargeScale Evolutionary Clustering

» Analysis of Approximation Algorithms for kSet Cover Using FactorRevealing Linear Programs

» Condition Numbers of Approximate Schur Complements in Two and ThreeDimensional Discretizat...

» Homomorphic factorization of BRDFbased lighting computation

Post Info
More Details (n/a)

Added	31 Mar 2016
Updated	31 Mar 2016
Type	Journal
Year	2016
Where	CORR
Authors	Amitabh Basu, Michael Dinitz, Xin Li 0006

Comments (0)

Sciweavers

Computing approximate PSD factorizations

CORR 2016 | Education |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers