2012 · 15 citations · 8 references
ComputingComputer ScienceHigh-performance ComputingAlgorithmsParallel AlgorithmsParallel ComputingData ParallelismGraphics Processing Unit ComputingLarge-scale OptimizationMatrix ComputationNumerical Linear AlgebraParallel Numerical MethodsGpu Parallel AlgorithmsLow-rank ApproximationLow-rank OptimizationNull SpaceParallel Matrix AlgorithmsSingular Value DecompositionSparse Matrix AlgorithmsSparse Matrix Computation
This paper provides an alternating optimization algorithm for large-scale matrix rank minimization problems and its parallel implementation on GPU. The matrix rank minimization problem has a lot of important applications in signal processing, and several useful algorithms have been proposed. However most algorithms cannot be applied to a large-scale problem because of high computational cost. This paper proposes a null space based algorithm, which provides a low-rank solution without computing inverse matrix nor singular value decomposition. The algorithm can be parallelized easily without any approximation and can be applied to a large-scale problem. Numerical examples show that the algorithm provides a low-rank solution efficiently and can be speed up by parallel GPU computing.
8
Exact matrix completion via convex optimization
Emmanuel J. Candès, Benjamin Recht · Communications of the ACM · 2012 · 1K citations