Solving a class of LP problems with a primal-dual logarithmic barrier method (Q1129972): Difference between revisions

@@ Property / cites work @@
+Q4298850
@@ Property / cites work: Q4298850 / rank @@
+Normal rank
@@ Property / cites work @@
+HOPDM - a higher order primal-dual method for large scale linear programming
+Normal rank
@@ Property / cites work @@
+Implementing the Simplex Method: The Initial Basis
+Normal rank
@@ Property / cites work @@
+A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
+Normal rank
@@ Property / cites work @@
+Q5588268
@@ Property / cites work: Q5588268 / rank @@
+Normal rank
@@ Property / cites work @@
+Implementing the simplex method for the Optimization Subroutine Library
+Normal rank
@@ Property / cites work @@
+Implementing interior point linear programming methods in the Optimization Subroutine Library
+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 @@
+Implementing cholesky factorization for interior point methods of linear programming
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for linear programming based on the logarithmic barrier method
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4206561
@@ Property / cites work: Q4206561 / rank @@
+Normal rank