Fixed point and Bregman iterative methods for matrix rank minimization (Q543413)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5909184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fixed point and Bregman iterative methods for matrix rank minimization |
scientific article; zbMATH DE number 5909184 |
Statements
Fixed point and Bregman iterative methods for matrix rank minimization (English)
0 references
17 June 2011
0 references
The authors propose a fixed point continuation algorithm and a Bregman iterative algorithm for solving the linearly constrained nuclear norm minimization problem. The convergence of the fixed point iterative algorithm is established. A Monte-Carlo approximate singular value decomposition procedure is incorporated into the fixed-point continuation algorithm to improve the speed and its ability to recover low-rank matrices. Some numerical results are presented to show the effectively of the proposed algorithm.
0 references
matrix rank minimization
0 references
matrix completion problem
0 references
nuclear norm minimization
0 references
fixed point iterative method
0 references
Bregman distances
0 references
singular value decomposition
0 references
continuation algorithm
0 references
convergence
0 references
Monte-Carlo approximate
0 references
numerical results
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8906916379928589
0 references
0.8873996734619141
0 references
0.8634676933288574
0 references
0.8479031324386597
0 references
