Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence (Q1893347): Difference between revisions

@@ Property / cites work @@
+A Polynomial-Time Predictor-Corrector Algorithm for a Class of Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+An interior point potential reduction algorithm for the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+AN O(n^3L) ALGORITHM USING A SEQUENCE FOR A LINEAR COMPLEMENTARITY PROBLEM
+Normal rank
@@ Property / cites work @@
+A new polynomial time method for a linear complementarity problem
+Normal rank
@@ Property / cites work @@
+On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems
+Normal rank
@@ Property / cites work @@
+Large-Step Interior Point Algorithms for Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Convergence behavior of interior-point algorithms
@@ Property / cites work: Convergence behavior of interior-point algorithms / rank @@
+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 @@
+A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
+Normal rank