In the real world, many kinds of high-dimensional data, such as images, documents, user-rating data, and health-related data, have internal low-dimensional structures. Mathematicians conceptualize the idea of ‘low-dimension’ as low-matrix-rank and developed various dimensionality reduction methods such as principal component analysis (PCA) and non-negative matrix factorization (NMF) under the low-matrix-rank assumption. This thesis contains four projects during my Ph.D. study. The target data sets of the first three projects are under the assumption of low-matrix-rank or low-tensor-rank. The first part focuses on a matrix completion task, where we propose a data completion method with convex regularizers to address the fragmented data issue...