A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307)
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: A primal-dual interior point method whose running time depends only on the constraint matrix |
scientific article; zbMATH DE number 977970
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A primal-dual interior point method whose running time depends only on the constraint matrix |
scientific article; zbMATH DE number 977970 |
Statements
A primal-dual interior point method whose running time depends only on the constraint matrix (English)
0 references
1996
0 references
layered least squares
0 references
interior point method
0 references
characterization of the central path
0 references
strongly polynomial time
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9482993483543396
0 references
0.8582980632781982
0 references
0.851215660572052
0 references
0.8261392116546631
0 references
