Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation. (Q1572663): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107980020a / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1237127655 / rank | |||
Normal rank | |||
Latest revision as of 01:03, 20 March 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
