Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization
Authors:
- Yicong HeYHYicong He
- Fei WangFWFei Wang
- Yingsong LiYLYingsong Li
- Jing QinJQJing Qin
- Badong ChenBadong Chen
- 8 November 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68, 181-195
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Basic Research Program of China (2015CB351703)
- National NSF of China (61273366, 91648208)
- National Science and Technology (2015BAH31F01)
This publication has 43 references indexed in Scilit:
- The C-loss function for pattern classificationPattern Recognition, 2014
- Half-Quadratic-Based Iterative Minimization for Robust Sparse RepresentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithmMathematical Programming Computation, 2012
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Interior-Point Method for Nuclear Norm Approximation with Application to System IdentificationSIAM Journal on Matrix Analysis and Applications, 2010
- Iterative hard thresholding for compressed sensingApplied and Computational Harmonic Analysis, 2009
- Fixed point and Bregman iterative methods for matrix rank minimizationMathematical Programming, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Analysis of Half-Quadratic Minimization Methods for Signal and Image RecoverySIAM Journal on Scientific Computing, 2005
- Techniques for nonlinear least squares and robust regressionCommunications in Statistics - Simulation and Computation, 1978