A non-convex algorithm framework based on DC programming and DCA for matrix completion (Q2340366)
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 6425944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A non-convex algorithm framework based on DC programming and DCA for matrix completion |
scientific article; zbMATH DE number 6425944 |
Statements
A non-convex algorithm framework based on DC programming and DCA for matrix completion (English)
0 references
16 April 2015
0 references
nonconvex algorithm
0 references
DC algorithms
0 references
nonconvex penalty
0 references
matrix completion
0 references
image recovery
0 references
nuclear norm minimization
0 references
numerical test
0 references
0 references
0 references
0 references
0 references
0 references
0.850184440612793
0 references
0.8223553895950317
0 references
0.8174318671226501
0 references
0.8094608783721924
0 references
0.8049736618995667
0 references
