An improved full-Newton step $O(n)$ infeasible interior-point method for horizontal linear complementarity problem (Q261844): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C33
@@ Property / Mathematics Subject Classification ID: 90C33 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C51
@@ Property / Mathematics Subject Classification ID: 90C51 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6560374
@@ Property / zbMATH DE Number: 6560374 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+horizontal linear complementarity problem
@@ Property / zbMATH Keywords: horizontal linear complementarity problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+infeasible interior-point method
@@ Property / zbMATH Keywords: infeasible interior-point method / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial complexity
@@ Property / zbMATH Keywords: polynomial complexity / 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/s11075-015-0005-7
+Normal rank
@@ Property / OpenAlex ID @@
+W253429297
@@ Property / OpenAlex ID: W253429297 / 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 @@
+Computational complexity of LCPs associated with positive definite symmetric matrices
+Normal rank
@@ Property / cites work @@
+Corrector-predictor methods for sufficient linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q4526886
@@ Property / cites work: Q4526886 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
+Normal rank
@@ Property / cites work @@
+Q4039868
@@ Property / cites work: Q4039868 / rank @@
+Normal rank
@@ Property / cites work @@
+On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
+Normal rank
@@ Property / cites work @@
+A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
+Normal rank
@@ Property / cites work @@
+Q4339096
@@ Property / cites work: Q4339096 / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
+Normal rank
@@ Property / cites work @@
+High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:261844

An improved full-Newton step \(O(n)\) infeasible interior-point method for horizontal linear complementarity problem (Q261844): Difference between revisions

Latest revision as of 15:58, 11 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)