An infeasible interior-point method with improved centering steps for monotone linear complementarity problems (Q3452701): Difference between revisions

@@ Property / cites work @@
+A new primal-dual path-following method for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Homotopy Continuation Methods for Nonlinear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s1793557115500370
+Normal rank
@@ Property / OpenAlex ID @@
+W2235556617
@@ Property / OpenAlex ID: W2235556617 / rank @@
+Normal rank