Computational Complexity of Decomposing a Symmetric Matrix as a Sum of Positive Semidefinite and Diagonal Matrices
Crossref DOI link: https://doi.org/10.1007/s10208-023-09637-4
Published Online: 2023-12-08
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Tunçel, Levent
Vavasis, Stephen A.
Xu, Jingye
Text and Data Mining valid from 2023-12-08
Version of Record valid from 2023-12-08
Article History
Received: 14 November 2022
Revised: 29 September 2023
Accepted: 12 October 2023
First Online: 8 December 2023