A new class of infeasible interior-point algorithm for linear complementarity problem (Q5400131): Difference between revisions

@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q2773659
@@ Property / cites work: Q2773659 / rank @@
+Normal rank
@@ Property / cites work @@
+A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
+Normal rank
@@ Property / cites work @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Feasibility issues in a primal-dual interior-point method for linear programming
+Normal rank
@@ Property / cites work @@
+Polynomiality of infeasible-interior-point algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Simplified<i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps
+Normal rank
@@ Property / cites work @@
+An infeasible interior-point algorithm with full-Newton step for linear optimization
+Normal rank