Projected Landweber iteration for matrix completion

DOI10.1016/j.cam.2010.06.010zbMath1225.65049OpenAlexW1984874910MaRDI QIDQ708281

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

zbMATH Keywords

optimizationalgorithmconvergencenumerical resultsmatrix completionFrobenius normnuclear normnonlinear constrained quadratic programmingprojected Landweber iteration

Mathematics Subject Classification ID

Related Items (6)

First-order optimality condition of basis pursuit denoise problem ⋮ Vector extrapolation based Landweber method for discrete ill-posed problems ⋮ Convergence of projected Landweber iteration for matrix rank minimization ⋮ 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

Uses Software

• SDPT3
• PROPACK
• PDCO
• SPGL1
• ParNes
• Eigentaste

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Distance matrix completion by numerical optimization
• Exact matrix completion via convex optimization
• Linearized Bregman iterations for compressed sensing
• Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
• A Singular Value Thresholding Algorithm for Matrix Completion
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
• Atomic Decomposition by Basis Pursuit
• Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication

This page was built for publication: Projected Landweber iteration for matrix completion