An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936): Difference between revisions

@@ Property / cites work @@
+A variation on Karmarkar’s algorithm for solving linear programming problems
+Normal rank
@@ Property / cites work @@
+The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
+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 @@
+Methods for Modifying Matrix Factorizations
@@ Property / cites work: Methods for Modifying Matrix Factorizations / rank @@
+Normal rank
@@ Property / cites work @@
+On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
+Normal rank
@@ Property / cites work @@
+Matrix factorizations in optimization of nonlinear functions subject to linear constraints
+Normal rank
@@ Property / cites work @@
+A numerically stable dual method for solving strictly convex quadratic programs
+Normal rank
@@ Property / cites work @@
+Q5543004
@@ Property / cites work: Q5543004 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5540119
@@ Property / cites work: Q5540119 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q3491304
@@ Property / cites work: Q3491304 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q3873927
@@ Property / cites work: Q3873927 / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. I: Linear programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+Q5655195
@@ Property / cites work: Q5655195 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
+Normal rank
@@ Property / cites work @@
+Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+An extension of Karmarkar's projective algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Q4097094
@@ Property / cites work: Q4097094 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01588795
+Normal rank
@@ Property / OpenAlex ID @@
+W2075023395
@@ Property / OpenAlex ID: W2075023395 / rank @@
+Normal rank