Analysis of singular value thresholding algorithm for matrix completion

DOI10.1007/s00041-019-09688-8zbMath1493.68305OpenAlexW2962442913WikidataQ127531961 ScholiaQ127531961MaRDI QIDQ2338558

Yunwen Lei, Ding-Xuan Zhou

Publication date: 21 November 2019

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00041-019-09688-8

zbMATH Keywords

matrix completionBregman distancemirror descentsingular-value thresholding

Mathematics Subject Classification ID

Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Matrix completion problems (15A83)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unregularized online learning algorithms with general loss functions
• On regularization algorithms in learning theory
• A randomized Kaczmarz algorithm with exponential convergence
• Introductory lectures on convex optimization. A basic course.
• Infinite-dimensional log-determinant divergences between positive definite trace class operators
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Convergence of online mirror descent
• Exact matrix completion via convex optimization
• Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Support Vector Machines
• Spectral Algorithms for Supervised Learning
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Learning Theory of Randomized Sparse Kaczmarz Method
• Thresholded spectral algorithms for sparse approximations
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Analysis of Online Composite Mirror Descent Algorithm
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

This page was built for publication: Analysis of singular value thresholding algorithm for matrix completion