Enhancing matrix completion using a modified second-order total variation
type: Item
instance of: scholarly article
title: Enhancing matrix completion using a modified second-order total variation
zbMATH Open document ID: 1417.90159
DOI: 10.1155/2018/2598160
author: Wendong Wang
author: Jianjun Wang
published in: Discrete Dynamics in Nature and Society
publication date: 2019-02-20T00:00:00Z
review text: Summary: In this paper, we propose a new method to deal with the matrix completion problem. Different from most existing matrix completion methods that only pursue the low rank of underlying matrices, the proposed method simultaneously optimizes their low rank and smoothness such that they mutually help each other and hence yield a better performance. In particular, the proposed method becomes very competitive with the introduction of a modified second-order total variation, even when it is compared with some recently emerged matrix completion methods that also combine the low rank and smoothness priors of matrices together. An efficient algorithm is developed to solve the induced optimization problem. The extensive experiments further confirm the superior performance of the proposed method over many state-of-the-art methods.
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A83
zbMATH DE Number: 7026531
describes a project that uses: ADMiRA
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/2598160
OpenAlex ID: W2890992157
cites work: Exact matrix completion via convex optimization
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Incoherence-Optimal Matrix Completion
cites work: Low-Rank Matrix Completion in the Presence of High Coherence
cites work: Q3161693
cites work: Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Fast singular value thresholding without singular value decomposition
cites work: A mathematical introduction to compressive sensing
cites work: Stable recovery of sparse signals via \(\ell_p\)-minimization
cites work: Sparse Signal Reconstruction via Iterative Support Detection
cites work: Minimization of $\ell_{1-2}$ for Compressed Sensing
cites work: On $l_q$ Optimization and Matrix Completion
cites work: Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
cites work: Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
cites work: Recovering low-rank and sparse matrix based on the truncated nuclear norm
cites work: Matrix Completion From a Few Entries
cites work: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
cites work: ADMiRA: Atomic Decomposition for Minimum Rank Approximation
cites work: Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
cites work: Linear total variation approximate regularized nuclear norm optimization for matrix completion
cites work: Smooth PARAFAC Decomposition for Tensor Completion
cites work: Tensor Decompositions and Applications
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: On the ADI method for Sylvester equations
Wikidata QID: Q57829556
description: scientific article; zbMATH DE number 7026531