Abstract

Abstract In the matrix completion problem, most methods to solve the nuclear norm model are relaxing it to the nuclear norm regularized least squares problem. In this paper, we propose a new unconstraint model for matrix completion problem based on nuclear norm and indicator function and design a proximal point algorithm (PPA-IF) to solve it. Then the convergence of our algorithm is established strictly. Finally, we report numerical results for solving noiseless and noisy matrix completion problems and image reconstruction.

Full Text
Published version (Free)

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 call