Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP (Q1264999): Difference between revisions

@@ Property / cites work @@
+Sufficient matrices and the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+\(P_ *\)-matrices are just sufficient
@@ Property / cites work: \(P_ *\)-matrices are just sufficient / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to interior point algorithms for linear complementarity problems: A summary
+Normal rank
@@ Property / cites work @@
+On a subclass of \(P_ 0\)
@@ Property / cites work: On a subclass of \(P_ 0\) / rank @@
+Normal rank
@@ Property / cites work @@
+On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
+Normal rank
@@ Property / cites work @@
+A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
+Normal rank
@@ Property / cites work @@
+Local convergence of interior-point algorithms for degenerate monotone LCP
+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 Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
+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