A long-step barrier method for convex quadratic programming (Q689102): Difference between revisions

@@ Property / cites work @@
+Q3783074
@@ Property / cites work: Q3783074 / 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 @@
+On the classical logarithmic barrier function method for a class of smooth convex programming problems
+Normal rank
@@ Property / cites work @@
+A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q5583564
@@ Property / cites work: Q5583564 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5588268
@@ Property / cites work: Q5588268 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739659
@@ Property / cites work: Q4739659 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
+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 @@
+Q3995706
@@ Property / cites work: Q3995706 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A unified approach to interior point algorithms for linear complementarity problems: A summary
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
+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 @@
+AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
+Normal rank
@@ Property / cites work @@
+Q4039868
@@ Property / cites work: Q4039868 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Unified complexity analysis for Newton LP methods
@@ Property / cites work: Unified complexity analysis for Newton LP methods / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial method of approximate centers for linear programming
+Normal rank
@@ Property / cites work @@
+A class of linear complementarity problems solvable in polynomial time
+Normal rank