Abstract
In this paper, we propose two accelerated algorithms for the low-rank approximate method in Wang et al. (0000) for matrix completion. The main idea is to use the successive over-relaxation technique. Based on the successive over-relaxation method for the feasible matrices or projection matrices, the low-rank matrix approximate method is modified and accelerated. Meanwhile, we discuss the convergence of the over-relaxation algorithm for the feasible matrix. Finally, the numerical experiments show them to be effective.
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.
