Affine matrix rank minimization problem via non-convex fraction function penalty

DOI10.1016/j.cam.2017.12.048zbMath1391.90488arXiv1611.07777OpenAlexW2963132223MaRDI QIDQ1696454

Yongchao Yu, Angang Cui, Hai-yang Li, Ji-Gen Peng, Cheng-Yi Zhang

Publication date: 14 February 2018

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matrix completionimage inpaintinglow-rankaffine matrix rank minimizationfraction functioniterative singular value thresholding algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Sparse signals recovered by non-convex penalty in quasi-linear systems ⋮ A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems ⋮ A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix ⋮ Estimation of the parameters of a weighted nuclear norm model and its application in image denoising ⋮ Majorized proximal alternating imputation for regularized rank constrained matrix completion

Cites Work

• Unnamed Item
• Recovery of sparsest signals via \(\ell^q \)-minimization
• An implementable proximal point algorithmic framework for nuclear norm minimization
• Fixed point and Bregman iterative methods for matrix rank minimization
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Exact matrix completion via convex optimization
• Guarantees of Riemannian Optimization for Low Rank Matrix Recovery
• Guaranteed Matrix Completion via Non-Convex Factorization
• $NP/CMP$ Equivalence: A Phenomenon Hidden Among Sparsity Models $l_{0}$ Minimization and $l_{p}$ Minimization for Information Processing
• An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Restricted isometry properties and nonconvex compressive sensing
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Iteratively reweighted least squares minimization for sparse recovery
• Minimizing Nonconvex Functions for Sparse Vector Reconstruction
• A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• L 1/2 regularization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

This page was built for publication: Affine matrix rank minimization problem via non-convex fraction function penalty