Minimizing Condition Number via Convex Programming (Q3225534)
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: Minimizing Condition Number via Convex Programming |
scientific article; zbMATH DE number 6016684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing Condition Number via Convex Programming |
scientific article; zbMATH DE number 6016684 |
Statements
Minimizing Condition Number via Convex Programming (English)
0 references
21 March 2012
0 references
condition number
0 references
diagonal preconditioner
0 references
convex programming
0 references
semidefinite programming
0 references
0.9173995
0 references
0.9119096
0 references
0.9042014
0 references
0.9018182
0 references
0.8977388
0 references
0.89238966
0 references
0.88940555
0 references
0.88878465
0 references
0.88657266
0 references
