Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization

DOI10.1109/TSP.2019.2952057MaRDI QIDQ5102560zbMATH OpenFDO

Authors Yicong He, Fei Wang, Yingsong Li, Jing Qin, Badong Chen

Publication date 23 September 2022

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.06055

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(12)

• A smoothing proximal gradient algorithm for matrix rank minimization problem
• T-product factorization based method for matrix and tensor completion problems
• Color image inpainting based on low-rank quaternion matrix factorization
• A generalized non-convex method for robust tensor completion
• Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem
• Robust Matrix Completion via Maximum Correntropy Criterion and Half Quadratic Optimization
• Noise-aware clustering based on maximum correntropy criterion and adaptive graph regularization
• Smooth robust tensor completion for background/foreground separation with missing pixels: novel algorithm with convergence guarantee
• Kernel generalized half-quadratic correntropy conjugate gradient algorithm for online prediction of chaotic time series
• Max-norm optimization for robust matrix recovery
• The robust multi-innovation estimation algorithm for Hammerstein non-linear systems with non-Gaussian noise
• Robust one-bit compressed sensing via continuous sign approximation and hybrid ordinary-Welsch function

This page was built for publication: Robust Matrix Completion via Maximum Correntropy Criterion and Half-Quadratic Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5102560)