Almost maximally rigid non-closedness conjecture
Almost maximally rigid non-closedness conjecture
Let denote the set of matrices that can be written as the sum of an matrix of rank at most and an matrix with at most nonzero entries. Almost maximally rigid non-closedness conjecture. The low-rank plus sparse set is not closed provided
for and . This would generalize the established non-closedness of to the highest sparsities allowed by the stated bounds, but the general case remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Jared Tanner, Andrew Thompson and Simon Vary, “Matrix rigidity and the ill-posedness of Robust PCA and matrix completion”, arXiv:1811.05919 (2019).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.