An alternating direction method with continuation for nonconvex low rank minimization (Q257130): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Eigentaste / rank | |||
Normal rank | |||
Revision as of 03:05, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternating direction method with continuation for nonconvex low rank minimization |
scientific article |
Statements
An alternating direction method with continuation for nonconvex low rank minimization (English)
0 references
15 March 2016
0 references
The authors present a nonconvex model of recovering low-rank matrices from the noisy measurement. The problem is formulated as a nonconvex regularized least squares optimization problem. An alternating direction method with a continuation technique is proposed. Under mild assumptions, the convergence behavior of the alternating direction method is proved. Some numerical experiments are given.
0 references
low rank minimization
0 references
alternating direction method
0 references
minimax concave penalty function
0 references
recovering low-rank matrices
0 references
least squares optimization problem
0 references
convergence
0 references
numerical experiment
0 references
