Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/10556780701550059
+Normal rank
@@ Property / OpenAlex ID @@
+W2111208481
@@ Property / OpenAlex ID: W2111208481 / rank @@
+Normal rank
@@ Property / cites work @@
+Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier
+Normal rank
@@ Property / cites work @@
+Lectures on Modern Convex Optimization
@@ Property / cites work: Lectures on Modern Convex Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Potential function methods for approximately solving linear programming problems: theory and practice.
+Normal rank
@@ Property / cites work @@
+Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
+Normal rank
@@ Property / cites work @@
+Rounding of Polytopes in the Real Number Model of Computation
+Normal rank
@@ Property / cites work @@
+Minimum-volume enclosing ellipsoids and core sets
@@ Property / cites work: Minimum-volume enclosing ellipsoids and core sets / rank @@
+Normal rank
@@ Property / cites work @@
+Introductory lectures on convex optimization. A basic course.
+Normal rank
@@ Property / cites work @@
+Smooth minimization of non-smooth functions
@@ Property / cites work: Smooth minimization of non-smooth functions / rank @@
+Normal rank
@@ Property / cites work @@
+Excessive Gap Technique in Nonsmooth Convex Minimization
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Fractional Packing and Covering Problems
+Normal rank