An infeasible-interior-point algorithm for linear complementarity problems (Q1340065): Difference between revisions

@@ Property / cites work @@
+Computational schemes for large-scale problems in extended linear- quadratic programming
+Normal rank
@@ Property / cites work @@
+Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
+Normal rank
@@ Property / cites work @@
+On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
+Normal rank
@@ Property / cites work @@
+Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
+Normal rank
@@ Property / cites work @@
+On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
+Normal rank
@@ Property / cites work @@
+Superlinear convergence of infeasible-interior-point methods for linear programming
+Normal rank
@@ Property / cites work @@
+On Q-order and R-order of convergence
@@ Property / cites work: On Q-order and R-order of convergence / rank @@
+Normal rank