Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (Q2366605): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01581234 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992241390 / rank | |||
Normal rank | |||
Latest revision as of 08:49, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Theoretical convergence of large-step primal-dual interior point algorithms for linear programming |
scientific article |
Statements
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming (English)
0 references
30 August 1993
0 references
generic primal-dual interior point method
0 references
global convergence
0 references
polynomial-time computational complexity
0 references
large steps
0 references
0 references
0 references
0 references
0 references
0 references
0 references
