Search directions for interior linear-programming methods (Q2639771): Difference between revisions

This paper examines several internal search directions for linear programming that were proposed since Karmarkar published his algorithm. The resulting algorithms are classified and compared, to be then imbedded in a common framework using a bidirectional search procedure on the original feasible set.

0 references

Mathematics Subject Classification ID

90C05

0 references

0 references

0 references

central trajectory

0 references

internal search directions

0 references

author

Clóvis C. Gonzaga

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A monotonic projective algorithm for fractional linear programming

0 references

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

0 references

Karmarkar's linear programming algorithm and Newton's method

0 references

Conic Approximations and Collinear Scalings for Optimizers

0 references

A variant of Karmarkar's linear programming algorithm for problems in standard form

0 references

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

0 references

Conical projection algorithms for linear programming

0 references

On the convexity of the multiplicative version of Karmarkar's potential function

0 references

A multiplicative barrier function method for linear programming

0 references

A new polynomial-time algorithm for linear programming

0 references

A polynomial-time algorithm, based on Newton's method, for linear programming

0 references

An extension of Karmarkar's algorithm for linear programming using dual variables

0 references

A modification of Karmarkar's linear programming algorithm

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2639771

@@ Property / cites work @@
+A monotonic projective algorithm for fractional linear programming
+Normal rank
@@ Property / cites work @@
+A variation on Karmarkar’s algorithm for solving linear programming problems
+Normal rank
@@ Property / cites work @@
+Karmarkar's linear programming algorithm and Newton's method
+Normal rank
@@ Property / cites work @@
+Conic Approximations and Collinear Scalings for Optimizers
+Normal rank
@@ Property / cites work @@
+A variant of Karmarkar's linear programming algorithm for problems in standard form
+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 @@
+Conical projection algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+On the convexity of the multiplicative version of Karmarkar's potential function
+Normal rank
@@ Property / cites work @@
+A multiplicative barrier function method for linear programming
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+An extension of Karmarkar's algorithm for linear programming using dual variables
+Normal rank
@@ Property / cites work @@
+A modification of Karmarkar's linear programming algorithm
+Normal rank