Guaranteed Matrix Completion via Non-Convex Factorization

Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization, even with huge size, can be solved very efficiently through the standard optimization algorithms in practice. However, due to the non-convexity caused by the fact...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 62; no. 11; pp. 6535 - 6579
Main Authors:	Sun, Ruoyu, Luo, Zhi-Quan
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.11.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Algorithms alternating minimization Complexity theory Economic conditions Factorization Geometry Information theory Iterative methods Mathematical models Matrix Matrix completion matrix factorization Minimization nonconvex optimization Optimization Partitioning algorithms perturbation analysis SGD
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!