scientific article; zbMATH DE number 7153946
From MaRDI portal
Publication:5210479
zbMath1433.65112MaRDI QIDQ5210479
Rahman Taleghani, Maziar Salahi
Publication date: 20 January 2020
Full work available at URL: http://www.pvamu.edu/aam/wp-content/uploads/sites/182/2019/12/34-AAM_R1253_Salahi_MS_010319_Published_121119.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Convex programming (90C25) Eigenvalues, singular values, and eigenvectors (15A18) Matrix completion problems (15A83)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed point and Bregman iterative methods for matrix rank minimization
- An alternating direction algorithm for matrix completion with nonnegative factors
- Low rank matrix completion by alternating steepest descent methods
- Removing multiplicative noise by Douglas-Rachford splitting methods
- Convex multi-task feature learning
- Low-rank matrix completion using nuclear norm minimization and facial reduction
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
- A mean value algorithm for Toeplitz matrix completion
- Exact matrix completion via convex optimization
- Low-Rank Matrix Completion by Riemannian Optimization
- Solving Constrained Total-variation Image Restoration and Reconstruction Problems via Alternating Direction Methods
- A Singular Value Thresholding Algorithm for Matrix Completion
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Semidefinite Programming
- Alternating direction method of multipliers for the extended trust region subproblem
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
This page was built for publication:
