On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms (Q4018396)
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: On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms |
scientific article; zbMATH DE number 90179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms |
scientific article; zbMATH DE number 90179 |
Statements
On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms (English)
0 references
16 January 1993
0 references
Newton's method
0 references
convergence rate analysis
0 references
interior point primal-dual linear programming algorithms
0 references
\(Q\)-superlinear convergence
0 references
nondegeneracy
0 references
duality gap
0 references
0.8879327774047852
0 references
0.8868269324302673
0 references
0.8782082200050354
0 references
0.8769718408584595
0 references
