In this paper, a unified matrix recovery model was proposed for diverse corrupted matrices. Resulting from the separable structure of the proposed model, the convex optimization problem can be solved efficiently by ad...In this paper, a unified matrix recovery model was proposed for diverse corrupted matrices. Resulting from the separable structure of the proposed model, the convex optimization problem can be solved efficiently by adopting an inexact augmented Lagrange multiplier (IALM) method. Additionally, a random projection accelerated technique (IALM+RP) was adopted to improve the success rate. From the preliminary numerical comparisons, it was indicated that for the standard robust principal component analysis (PCA) problem, IALM+RP was at least two to six times faster than IALM with an insignificant reduction in accuracy; and for the outlier pursuit (OP) problem, IALM+RP was at least 6.9 times faster, even up to 8.3 times faster when the size of matrix was 2 000×2 000.展开更多
Strict proof has been given to single valley character of level degree function by use of convex analysis theory, which provides reliable theoretical basis for the optimization of the data processing with respect to l...Strict proof has been given to single valley character of level degree function by use of convex analysis theory, which provides reliable theoretical basis for the optimization of the data processing with respect to level degree. As circle degree and cylindrical degree have the same mathematical structures, their single valley character can be proved by the same method.展开更多
基金Supported by National Natural Science Foundation of China (No.51275348)College Students Innovation and Entrepreneurship Training Program of Tianjin University (No.201210056339)
文摘In this paper, a unified matrix recovery model was proposed for diverse corrupted matrices. Resulting from the separable structure of the proposed model, the convex optimization problem can be solved efficiently by adopting an inexact augmented Lagrange multiplier (IALM) method. Additionally, a random projection accelerated technique (IALM+RP) was adopted to improve the success rate. From the preliminary numerical comparisons, it was indicated that for the standard robust principal component analysis (PCA) problem, IALM+RP was at least two to six times faster than IALM with an insignificant reduction in accuracy; and for the outlier pursuit (OP) problem, IALM+RP was at least 6.9 times faster, even up to 8.3 times faster when the size of matrix was 2 000×2 000.
文摘Strict proof has been given to single valley character of level degree function by use of convex analysis theory, which provides reliable theoretical basis for the optimization of the data processing with respect to level degree. As circle degree and cylindrical degree have the same mathematical structures, their single valley character can be proved by the same method.