Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. (Q1572663): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PDNET / rank | |||
Normal rank | |||
Revision as of 23:44, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. |
scientific article |
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
