Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694): Difference between revisions

@@ Property / cites work @@
+A cutting plane algorithm for convex programming that uses analytic centers
+Normal rank
@@ Property / cites work @@
+Decomposition and Nondifferentiable Optimization with the Projective Algorithm
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q4182272
@@ Property / cites work: Q4182272 / rank @@
+Normal rank
@@ Property / cites work @@
+Location of the Maximum on Unimodal Surfaces
@@ Property / cites work: Location of the Maximum on Unimodal Surfaces / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+Q3780013
@@ Property / cites work: Q3780013 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
+Normal rank
@@ Property / cites work @@
+A new algorithm for minimizing convex functions over convex sets
+Normal rank
@@ Property / cites work @@
+A Potential Reduction Algorithm Allowing Column Generation
+Normal rank
@@ Property / cites work @@
+Q4097094
@@ Property / cites work: Q4097094 / rank @@
+Normal rank