An efficient inexact ABCD method for least squares semidefinite programming (Q2805705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient inexact ABCD method for least squares semidefinite programming |
scientific article; zbMATH DE number 6580060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient inexact ABCD method for least squares semidefinite programming |
scientific article; zbMATH DE number 6580060 |
Statements
13 May 2016
0 references
least squares semidefinite programming
0 references
accelerated block coordinate descent
0 references
symmetric Gauss-Seidel
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
An efficient inexact ABCD method for least squares semidefinite programming (English)
0 references
0.8259331583976746
0 references
0.7962648272514343
0 references
0.7843737602233887
0 references
0.7740734815597534
0 references
0.7663635611534119
0 references
