Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems (Q1919097): Difference between revisions

@@ Property / cites work @@
+Q4323601
@@ Property / cites work: Q4323601 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+On the convergence of the method of analytic centers when applied to convex quadratic programs
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
+Normal rank
@@ Property / cites work @@
+On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A Centered Projective Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3L)\) potential reduction algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Comparative analysis of affine scaling algorithms based on simplifying assumptions
+Normal rank