On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411): Difference between revisions

@@ Property / cites work @@
+An Algorithm for Separating Patterns by Ellipsoids
+Normal rank
@@ Property / cites work @@
+Q3276750
@@ Property / cites work: Q3276750 / rank @@
+Normal rank
@@ Property / cites work @@
+Über das Löwnersche Ellipsoid und sein Analogon unter den einem Eikörper einbeschriebenen Ellipsoiden
+Normal rank
@@ Property / cites work @@
+On the complexity of four polyhedral set containment problems
+Normal rank
@@ Property / cites work @@
+Q5791470
@@ Property / cites work: Q5791470 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+Q4204004
@@ Property / cites work: Q4204004 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal design: Some geometrical aspects of D-optimality
+Normal rank
@@ Property / cites work @@
+A Potential Reduction Algorithm Allowing Column Generation
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01582144
+Normal rank
@@ Property / OpenAlex ID @@
+W2055356142
@@ Property / OpenAlex ID: W2055356142 / rank @@
+Normal rank