Abstract
This paper considers the problem of reconstructing a N × N low rank positive semidefinite Toeplitz matrix from a noisy compressed sketch of size O(√r) × O (√r) where r << N is the rank of the matrix. A novel algorithm is proposed which only exploits a positive semidefinite (PSD) constraint to denoise the compressed sketch using a simple least squares approach. A major advantage of our algorithm is that it does not require any regularization parameter. The PSD constraint, along with Vandermonde representation of PSD Toeplitz matrices are proved to be sufficient for stable reconstruction in presence of bounded noise.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
