most citedComputational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

math.OC2022★ 2 cited

Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices

Levent Tunçel, Stephen A. Vavasis, Jingye Xu

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in fa…