Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550): Difference between revisions

@@ Property / cites work @@
+A cutting plane algorithm for convex programming that uses analytic centers
+Normal rank
@@ Property / cites work @@
+Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
+Normal rank
@@ Property / cites work @@
+A cutting plane method from analytic centers for stochastic programming
+Normal rank
@@ Property / cites work @@
+A central cutting plane algorithm for the convex programming problem
+Normal rank
@@ Property / cites work @@
+Decomposition and Nondifferentiable Optimization with the Projective Algorithm
+Normal rank
@@ Property / cites work @@
+Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+Q4311911
@@ Property / cites work: Q4311911 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4192594
@@ Property / cites work: Q4192594 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4296156
@@ Property / cites work: Q4296156 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
+Normal rank
@@ Property / cites work @@
+A logarithmic barrier cutting plane method for convex programming
+Normal rank
@@ Property / cites work @@
+A build-up variant of the logarithmic barrier method for LP
+Normal rank
@@ Property / cites work @@
+Q4840104
@@ Property / cites work: Q4840104 / rank @@
+Normal rank
@@ Property / cites work @@
+A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4735039
@@ Property / cites work: Q4735039 / rank @@
+Normal rank
@@ Property / cites work @@
+Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms in linear programming
@@ Property / cites work: Polynomial algorithms in linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating the maximal inscribed ellipsoid for a polytope
+Normal rank
@@ Property / cites work @@
+Q5535546
@@ Property / cites work: Q5535546 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts
+Normal rank
@@ Property / cites work @@
+Q5202851
@@ Property / cites work: Q5202851 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the center of a convex quadratically constrained set
+Normal rank
@@ Property / cites work @@
+Solving combinatorial optimization problems using Karmarkar's algorithm
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3967358
@@ Property / cites work: Q3967358 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity estimates of some cutting plane methods based on the analytic barrier
+Normal rank
@@ Property / cites work @@
+A polynomial method of approximate centers for linear programming
+Normal rank
@@ Property / cites work @@
+Q5187067
@@ Property / cites work: Q5187067 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4204004
@@ Property / cites work: Q4204004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3780013
@@ Property / cites work: Q3780013 / rank @@
+Normal rank
@@ Property / cites work @@
+A Potential Reduction Algorithm Allowing Column Generation
+Normal rank
@@ Property / cites work @@
+Complexity analysis of the analytic center cutting plane method that uses multiple cuts
+Normal rank