A polynomial arc-search interior-point algorithm for linear programming (Q378268): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Changed label, description and/or aliases in en, and other parts |
EloiFerrer (talk | contribs) Merged Item from Q521915 |
||||||||||||||
| aliases / en / 0 | aliases / en / 0 | ||||||||||||||
CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming | |||||||||||||||
| description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 6705281 | |||||||||||||||
| Property / title | |||||||||||||||
CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming (English) | |||||||||||||||
| Property / title: CurveLP-A MATLAB implementation of an infeasible interior-point algorithm for linear programming (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Open document ID | |||||||||||||||
| Property / zbMATH Open document ID: 1378.65127 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / DOI | |||||||||||||||
| Property / DOI: 10.1007/s11075-016-0180-1 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / published in | |||||||||||||||
| Property / published in: Numerical Algorithms / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / publication date | |||||||||||||||
12 April 2017
| |||||||||||||||
| Property / publication date: 12 April 2017 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / Mathematics Subject Classification ID | |||||||||||||||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH DE Number | |||||||||||||||
| Property / zbMATH DE Number: 6705281 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
infeasible interior-point algorithm | |||||||||||||||
| Property / zbMATH Keywords: infeasible interior-point algorithm / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
Netlib problems | |||||||||||||||
| Property / zbMATH Keywords: Netlib problems / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
Mehrotra's algorithm | |||||||||||||||
| Property / zbMATH Keywords: Mehrotra's algorithm / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / OpenAlex ID | |||||||||||||||
| Property / OpenAlex ID: W3099770231 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / review text | |||||||||||||||
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. | |||||||||||||||
| Property / review text: 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. / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / reviewed by | |||||||||||||||
| Property / reviewed by: Başak Akteke-Öztürk / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / describes a project that uses | |||||||||||||||
| Property / describes a project that uses: Netlib / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / describes a project that uses | |||||||||||||||
| Property / describes a project that uses: LOQO / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / describes a project that uses | |||||||||||||||
| Property / describes a project that uses: LIPSOL / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / describes a project that uses | |||||||||||||||
| Property / describes a project that uses: Matlab / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / describes a project that uses | |||||||||||||||
| Property / describes a project that uses: PCx / rank | |||||||||||||||
Normal rank | |||||||||||||||
Revision as of 11:56, 29 April 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
