Abstract: Matrix completion refers to recovering a matrix from a small subset of its entries. It is an important topic because numerous real-world data can be modeled as low-rank matrices. One popular ...

Abstract: The log-sum function as a penalty has always been drawing widespread attention in the field of sparse problems. However, it brings a non-convex, non-smooth and non-Lipschitz optimization ...