An $\ell_{2}$-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607): Difference between revisions

@@ Property / DOI @@
-.1007/s10288-016-0325-z
@@ Property / DOI: 10.1007/s10288-016-0325-z / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10288-016-0325-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2468126360
@@ Property / OpenAlex ID: W2468126360 / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
+Normal rank
@@ Property / cites work @@
+Q4091004
@@ Property / cites work: Q4091004 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A unified approach to interior point algorithms for linear complementarity problems: A summary
+Normal rank
@@ Property / cites work @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
+Normal rank
@@ Property / cites work @@
+A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
+Normal rank
@@ Property / cites work @@
+A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
+Normal rank
@@ Property / cites work @@
+A polynomial arc-search interior-point algorithm for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+A polynomial arc-search interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
+Normal rank
@@ Property / cites work @@
+An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A wide neighborhood infeasible-interior-point method with arc-search for linear programming
+Normal rank
@@ Property / cites work @@
+An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path
+Normal rank
@@ Property / cites work @@
+On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
+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 / DOI @@
+.1007/S10288-016-0325-Z
@@ Property / DOI: 10.1007/S10288-016-0325-Z / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2399607

An \(\ell_{2}\)-neighborhood infeasible interior-point algorithm for linear complementarity problems (Q2399607): Difference between revisions

Latest revision as of 10:01, 18 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)