A polynomial arc-search interior-point algorithm for linear programming (Q378268): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(6 intermediate revisions by 5 users not shown) | |||||||||||||||
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 | 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 / MaRDI profile type | |||||||||||||||
Property / MaRDI profile type: MaRDI publication profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W1992596978 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / OpenAlex ID | |||||||||||||||
Property / OpenAlex ID: W3099770231 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / arXiv ID | |||||||||||||||
Property / arXiv ID: 1406.4539 / 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 | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4051879 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q3050157 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Feature Article—The Ellipsoid Method: A Survey / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q3491304 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Multiple centrality corrections in a primal-dual method for linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: The many facets of linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q5691079 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On Mehrotra-Type Predictor-Corrector Algorithms / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Long-step strategies in interior-point primal-dual methods / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A polynomial arc-search interior-point algorithm for convex quadratic programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4091004 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q3411977 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4206561 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Polynomiality of infeasible-interior-point algorithms for linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A MODIFIED FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR LINEAR OPTIMIZATION / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Addressing rank degeneracy in constraint-reduced interior-point methods for linear optimization / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: LOQO:an interior point code for quadratic programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A polynomial arc-search interior-point algorithm for linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Presolving in linear programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Globally convergent algorithms for robust pole assignment by state feedback / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Benchmarking optimization software with performance profiles. / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On the Automatic Scaling of Matrices for Gaussian Elimination / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4692656 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Modification of the minimum-degree algorithm by multiple elimination / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q3236242 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Degeneracy in interior point methods for linear programming: A survey / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A primal-dual interior point method whose running time depends only on the constraint matrix / rank | |||||||||||||||
Normal rank |
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