Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. (Q1572663)
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: Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. |
scientific article; zbMATH DE number 1479722
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. |
scientific article; zbMATH DE number 1479722 |
Statements
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. (English)
0 references
21 July 2000
0 references
linear programming problem
0 references
interior-point method
0 references
primal-dual
0 references
convergence
0 references
inexact computation
0 references
