Feasibility issues in a primal-dual interior-point method for linear programming (Q803044): Difference between revisions

The author proposes a new method (based on the generic primal-dual algorithm) for obtaining an initial feasible interior-point solution to a linear program which avoids the use of a ``big-\({\mathcal M}''\).

0 references

zbMATH Keywords

primal-dual algorithm

0 references

initial feasible interior-point solution

0 references

reviewed by

Jiří Rohn

0 references

describes a project that uses

MINOS

0 references

symrcm

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

An implementation of Karmarkar's algorithm for linear programming

0 references

A variation on Karmarkar’s algorithm for solving linear programming problems

0 references

Further Development of a Primal-Dual Interior Point Method

0 references

Q5583564

0 references

Q3664299

0 references

On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

0 references

A practical anti-cycling procedure for linearly constrained optimization

0 references

A new polynomial-time algorithm for linear programming

0 references

Q3491304

0 references

The multifrontal method and paging in sparse Cholesky factorization

0 references

An analysis of an available set of linear programming test problems

0 references

An Implementation of a Primal-Dual Interior Point Method for Linear Programming

0 references

Computational experience with a dual affine variant of Karmarkar's method for linear programming

0 references

Interior path following primal-dual algorithms. I: Linear programming

0 references

A modification of Karmarkar's linear programming algorithm

0 references

full work available at URL

https://doi.org/10.1007/bf01588785

0 references

Identifiers

zbMATH Open document ID

0726.90050

0 references

DOI

10.1007/BF01588785

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:803044

@@ Property / cites work @@
+An implementation of Karmarkar's algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A variation on Karmarkar’s algorithm for solving linear programming problems
+Normal rank
@@ Property / cites work @@
+Further Development of a Primal-Dual Interior Point Method
+Normal rank
@@ Property / cites work @@
+Q5583564
@@ Property / cites work: Q5583564 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3664299
@@ Property / cites work: Q3664299 / rank @@
+Normal rank
@@ Property / cites work @@
+On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
+Normal rank
@@ Property / cites work @@
+A practical anti-cycling procedure for linearly constrained optimization
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q3491304
@@ Property / cites work: Q3491304 / rank @@
+Normal rank
@@ Property / cites work @@
+The multifrontal method and paging in sparse Cholesky factorization
+Normal rank
@@ Property / cites work @@
+An analysis of an available set of linear programming test problems
+Normal rank
@@ Property / cites work @@
+An Implementation of a Primal-Dual Interior Point Method for Linear Programming
+Normal rank
@@ Property / cites work @@
+Computational experience with a dual affine variant of Karmarkar's method for linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+A modification of Karmarkar's linear programming algorithm
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01588785
+Normal rank
@@ Property / OpenAlex ID @@
+W2094757704
@@ Property / OpenAlex ID: W2094757704 / rank @@
+Normal rank