Title
Augmented Lagrangian alternating direction method for low-rank minimization via non-convex approximation.
Abstract
This paper concerns the low-rank minimization problems which consist of finding a matrix of minimum rank subject to linear constraints. Many existing approaches, which used the nuclear norm as a convex surrogate of the rank function, usually result in a suboptimal solution. To seek a tighter rank approximation, we develop a non-convex surrogate to approximate the rank function based on the Laplace function. An iterative algorithm based on the augmented Lagrangian multipliers method is developed. Empirical studies for practical applications including robust principal component analysis and low-rank representation demonstrate that our proposed algorithm outperforms many other state-of-the-art convex and non-convex methods developed recently in the literature.
Year
DOI
Venue
2017
10.1007/s11760-017-1084-9
Signal, Image and Video Processing
Keywords
Field
DocType
Low-rank minimization, Non-convex approximation, Iterative algorithm, Difference of convex programming
Mathematical optimization,Matrix norm,Robust principal component analysis,Augmented Lagrangian method,Low-rank approximation,Proper convex function,Convex optimization,Ellipsoid method,Mathematics,Convex analysis
Journal
Volume
Issue
ISSN
11
7
1863-1703
Citations 
PageRank 
References 
9
0.47
19
Authors
4
Name
Order
Citations
PageRank
Yongyong Chen17412.11
Yong-li Wang210726.46
Mingqiang Li3122.18
Guoping He49113.59