PCx: an interior-point code for linear programming (Q4504787): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/10556789908805757
+Normal rank
@@ Property / OpenAlex ID @@
+W2013945499
@@ Property / OpenAlex ID: W2013945499 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Automatic Scaling of Matrices for Gaussian Elimination
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
+Normal rank
@@ Property / cites work @@
+Modification of the minimum-degree algorithm by multiple elimination
+Normal rank
@@ Property / cites work @@
+The Role of Elimination Trees in Sparse Factorization
+Normal rank
@@ Property / cites work @@
+On the Implementation of a Primal-Dual Interior Point Method
+Normal rank
@@ Property / cites work @@
+Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
+Normal rank
@@ Property / cites work @@
+Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q5691079
@@ Property / cites work: Q5691079 / rank @@
+Normal rank