A polynomial arc-search interior-point algorithm for linear programming (Q378268): Difference between revisions
From MaRDI portal
Latest revision as of 16:59, 13 July 2024
scientific article; zbMATH DE number 6705281
- CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming
Language | Label | Description | Also known as |
---|---|---|---|
English | A polynomial arc-search interior-point algorithm for linear programming |
scientific article; zbMATH DE number 6705281 |
|
Statements
A polynomial arc-search interior-point algorithm for linear programming (English)
0 references
CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming (English)
0 references
11 November 2013
0 references
12 April 2017
0 references
arc-search
0 references
interior-point method
0 references
polynomial algorithm
0 references
linear programming
0 references
infeasible interior-point algorithm
0 references
Netlib problems
0 references
Mehrotra's algorithm
0 references
The author develops a competitive arc-feasible infeasible interior-point algorithm. He shows that based on the results on Netlib problems, the comparison of Mehrotra's algorithm and the arc-feasible infeasible interior-point algorithm yields that the proposed arc-feasible infeasible interior-point algorithm is a more reliable and efficient algorithm than Mehrotra's algorithm. This article is well written, structured and explained, it contains six sections: Section 1 on Introduction, Section 2 on Problem descriptions, Section 3 on Arc-search algorithm for linear programming, Section 4 on Implementation details, Section 5 on Numerical tests, and, Section 6 on Conclusions.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references