Solving quadratically constrained convex optimization problems with an interior-point method (Q3093053): Difference between revisions

@@ Property / cites work @@
+Q3664299
@@ Property / cites work: Q3664299 / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
+Normal rank
@@ Property / cites work @@
+Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+Computational experience with a primal-dual interior point method for linear programming
+Normal rank
@@ Property / cites work @@
+Fast Cholesky factorization for interior point methods of linear programming
+Normal rank
@@ Property / cites work @@
+The BPMPD interior point solver for convex quadratic problems
+Normal rank
@@ Property / cites work @@
+The Cholesky factorization in interior point methods
+Normal rank
@@ Property / cites work @@
+Sparsity in convex quadratic programming with interior point methods
+Normal rank
@@ Property / cites work @@
+On Numerical Issues of Interior Point Methods
@@ Property / cites work: On Numerical Issues of Interior Point Methods / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
+Normal rank
@@ Property / cites work @@
+Symmetric Quasidefinite Matrices
@@ Property / cites work: Symmetric Quasidefinite Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Minimum Fill-In is NP-Complete
@@ Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank @@
+Normal rank