On the worst case complexity of potential reduction algorithms for linear programming (Q1373761): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Dimitris J. Bertsimas / rank | |||
| Property / author | |||
| Property / author: Xiao-Dong Luo / rank | |||
| Property / author | |||
| Property / author: Dimitris J. Bertsimas / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Xiao-Dong Luo / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:06, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the worst case complexity of potential reduction algorithms for linear programming |
scientific article |
Statements
On the worst case complexity of potential reduction algorithms for linear programming (English)
0 references
3 August 1998
0 references
lower bounds on complexity
0 references
interior point algorithms
0 references
potential reduction algorithms
0 references
