Projected Landweber iteration for matrix completion
DOI10.1016/J.CAM.2010.06.010zbMATH Open1225.65049OpenAlexW1984874910MaRDI QIDQ708281FDOQ708281
Authors: Hui Zhang, Li-zhi Cheng 
Publication date: 11 October 2010
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2010.06.010
Recommendations
- Convergence of projected Landweber iteration for matrix rank minimization
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Low-rank approximation algorithms for matrix completion with random sampling
- Normalized iterative hard thresholding for matrix completion
- A new gradient projection method for matrix completion
optimizationconvergencematrix completionnuclear normnumerical resultsalgorithmFrobenius normnonlinear constrained quadratic programmingprojected Landweber iteration
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Matrix completion problems (15A83)
Cites Work
- Probing the Pareto frontier for basis pursuit solutions
- Title not available (Why is that?)
- Atomic Decomposition by Basis Pursuit
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- Eigentaste: A constant time collaborative filtering algorithm
- Linearized Bregman iterations for compressed sensing
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Interior-point method for nuclear norm approximation with application to system identification
- ParNes: A rapidly convergent algorithm for accurate recovery of sparse and approximately sparse signals
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
- Distance matrix completion by numerical optimization
Cited In (6)
- Vector extrapolation based Landweber method for discrete ill-posed problems
- Convergence analysis of projected gradient descent for Schatten-\(p\) nonconvex matrix recovery
- Projected randomized Kaczmarz methods
- Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
- Convergence of projected Landweber iteration for matrix rank minimization
- First-order optimality condition of basis pursuit denoise problem
Uses Software
This page was built for publication: Projected Landweber iteration for matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708281)
