Matrix Completion with Convex Optimization and Column Subset Selection

arXiv:2403.01919v1 Announce Type: new
Abstract: We introduce a two-step method for the matrix recovery problem. Our approach combines the theoretical foundations of the Column Subset Selection and Low-rank Matrix Completion problems. The proposed method, in each step, solves a convex optimization task. We present two algorithms that implement our Columns Selected Matrix Completion (CSMC) method, each dedicated to a different size problem. We performed a formal analysis of the presented method, in which we formulated the necessary assumptions and the …

abstract algorithms arxiv column cs.lg low matrix optimization recovery the matrix type