Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem (Q4302311)
From MaRDI portal
scientific article; zbMATH DE number 618186
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem |
scientific article; zbMATH DE number 618186 |
Statements
Superlinearly Convergent $O ( \sqrt{n} L )$-Iteration Interior-Point Algorithms for Linear Programming and the Monotone Linear Complementarity Problem (English)
0 references
14 August 1994
0 references
linear complementarity
0 references
primal-dual interior-point algorithms
0 references
super- linear convergence
0 references
quadratic convergence
0 references
polynomiality
0 references
duality gap
0 references
