Detecting ``dense'' columns in interior point methods for linear programs (Q2643620)
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: Detecting ``dense columns in interior point methods for linear programs |
scientific article; zbMATH DE number 5182949
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting ``dense'' columns in interior point methods for linear programs |
scientific article; zbMATH DE number 5182949 |
Statements
Detecting ``dense'' columns in interior point methods for linear programs (English)
0 references
27 August 2007
0 references
Interior point methods
0 references
dense columns
0 references
Cholesky factorization
0 references
sparsity
0 references
0 references
0 references
0.8297038674354553
0 references
0.8220018744468689
0 references
0.807999849319458
0 references
0.8065743446350098
0 references
0.8042083382606506
0 references
