The minimum-rank Gram matrix completion via a fixed point continuation method (Q3110296)
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 6000960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum-rank Gram matrix completion via a fixed point continuation method |
scientific article; zbMATH DE number 6000960 |
Statements
27 January 2012
0 references
low rank Gram matrix
0 references
sum of squares
0 references
minimum-rank Gram matrix completion
0 references
matrix rank minimization
0 references
convex relaxation
0 references
nuclear norm minimization
0 references
semidefinite programming
0 references
fixed point iterative algorithm
0 references
convergence
0 references
Barzilai-Borwein technique
0 references
0.8906916379928589
0 references
0.8871613144874573
0 references
0.8720418214797974
0 references
0.8381319642066956
0 references
0.8368120193481445
0 references
