A new method based on the manifold-alternative approximating for low-rank matrix completion
type: Item
instance of: scholarly article
title: A new method based on the manifold-alternative approximating for low-rank matrix completion
zbMATH Open document ID: 1498.65060
author: Fujiao Ren
author: Ruiping Wen
published in: Journal of Inequalities and Applications
publication date: 2021-12-15T00:00:00Z
Mathematics Subject Classification ID: 65F55
Mathematics Subject Classification ID: 15A83
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7446056
zbMATH Keywords: manifold-alternative approximating
zbMATH Keywords: low rank
zbMATH Keywords: matrix completion
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: s13660-018-1931-4
OpenAlex ID: W2904045308
Wikidata QID: Q60303384
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Exact matrix completion via convex optimization
cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion
cites work: Signal Recovery by Proximal Forward-Backward Splitting
cites work: Q3444931
cites work: The complexity of matrix completion
cites work: Low-rank matrix completion using alternating minimization
cites work: Matrix recipes for hard thresholding methods
cites work: Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
cites work: On the rank minimization problem over a positive semidefinite linear matrix inequality
cites work: Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
cites work: Low rank matrix completion by alternating steepest descent methods
cites work: On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
cites work: Q3161693
cites work: Low-rank matrix completion by Riemannian optimization
cites work: Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
cites work: Characterization of the subdifferential of some matrix norms
cites work: The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion
cites work: A new gradient projection method for matrix completion
cites work: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
cites work: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
DOI: 10.1186/S13660-018-1931-4
description: scientific article; zbMATH DE number 7446056