Deriving an unconstrained convex program for linear programming (Q1321279): Difference between revisions

@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+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 @@
+Karmarkar's linear programming algorithm and Newton's method
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+Insights into the interior-point methods
@@ Property / cites work: Insights into the interior-point methods / rank @@
+Normal rank
@@ Property / cites work @@
+Entropy in linear programs
@@ Property / cites work: Entropy in linear programs / rank @@
+Normal rank
@@ Property / cites work @@
+Confidence levels using noral approxiation to modified<i>t</i>-Statistics for dependent Variables
+Normal rank
@@ Property / cites work @@
+Quadratically constrained minimum cross-entropy analysis
+Normal rank
@@ Property / cites work @@
+Q5588268
@@ Property / cites work: Q5588268 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric Programming
@@ Property / cites work: Geometric Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q5557595
@@ Property / cites work: Q5557595 / rank @@
+Normal rank
@@ Property / cites work @@
+On the convex programming approach to linear programming
+Normal rank