On complexity of the translational-cut algorithm for convex minimax problems (Q5925720): Difference between revisions

@@ Property / cites work @@
+Q2743983
@@ Property / cites work: Q2743983 / rank @@
+Normal rank
@@ Property / cites work @@
+A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
+Normal rank
@@ Property / cites work @@
+Q5202851
@@ Property / cites work: Q5202851 / rank @@
+Normal rank
@@ Property / cites work @@
+Rates of convergence for a method of centers algorithm
+Normal rank
@@ Property / cites work @@
+Subproblem and Overall Convergence for a Method-of-Centers Algorithm
+Normal rank
@@ Property / cites work @@
+Q5652137
@@ Property / cites work: Q5652137 / rank @@
+Normal rank
@@ Property / cites work @@
+A global Newton method. II: Analytic centers
@@ Property / cites work: A global Newton method. II: Analytic centers / rank @@
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for convex programming that uses analytic centers
+Normal rank
@@ Property / cites work @@
+Feature Article—The Ellipsoid Method: A Survey
@@ Property / cites work: Feature Article—The Ellipsoid Method: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for minimizing convex functions over convex sets
+Normal rank
@@ Property / cites work @@
+On Vaidya's Volumetric Cutting Plane Method for Convex Programming
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1023/a:1026422013954
+Normal rank
@@ Property / OpenAlex ID @@
+W1795420581
@@ Property / OpenAlex ID: W1795420581 / rank @@
+Normal rank