2000 character limit reached
Low-rank matrix recovery with Ky Fan 2-k-norm
Published 11 Apr 2019 in math.OC | (1904.05590v1)
Abstract: We propose Ky Fan 2-k-norm-based models for the nonconvex low-rank matrix recovery problem. A general difference of convex algorithm (DCA) is developed to solve these models. Numerical results show that the proposed models achieve high recoverability rates.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.