Low rank matrix completion by alternating steepest descent methods
type: Item
instance of: scholarly article
title: Low rank matrix completion by alternating steepest descent methods
zbMATH Open document ID: 1336.65047
author: Jared Tanner
author: Ke Wei
published in: Applied and Computational Harmonic Analysis
publication date: 2016-01-28T00:00:00Z
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 15A83
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 94A12
Mathematics Subject Classification ID: 15A29
zbMATH DE Number: 6536879
zbMATH Keywords: matrix completion
zbMATH Keywords: alternating minimization
zbMATH Keywords: gradient descent
zbMATH Keywords: exact line-search
describes a project that uses: LMaFit
describes a project that uses: RTRMC
MaRDI profile type: Publication
full work available at URL: j.acha.2015.08.003
OpenAlex ID: W1548998364
cites work: CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
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: Q3444931
cites work: Q3172946
cites work: Globally convergent block-coordinate techniques for unconstrained optimization
cites work: The complexity of matrix completion
cites work: Matrix Completion From a Few Entries
cites work: Matrix recipes for hard thresholding methods
cites work: Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
cites work: Fixed-rank matrix factorizations and Riemannian low-rank optimization
cites work: Normalized iterative hard thresholding for matrix completion
cites work: Low-rank matrix completion by Riemannian optimization
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.1016/J.ACHA.2015.08.003
description: scientific article; zbMATH DE number 6536879