The complexity of high-order interior-point methods for solving sufficient complementarity problems. (Q2759585)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of high-order interior-point methods for solving sufficient complementarity problems. |
scientific article; zbMATH DE number 1683555
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of high-order interior-point methods for solving sufficient complementarity problems. |
scientific article; zbMATH DE number 1683555 |
Statements
15 January 2002
0 references
linear complementarity problem
0 references
sufficient matrices
0 references
infeasible interior point paths
0 references
The complexity of high-order interior-point methods for solving sufficient complementarity problems. (English)
0 references
The authors consider a class of infeasible interior point pahts methods for solving sufficient linear complementarity problems. The class of method considered has been shorn to be superlinear convergent with an arbitrarily high order even for degenerate problems and for problems without strict complementary solutions. The author shows that the class of methods considered needs \(O((1+k)^2n| \log \varepsilon| )\) steps to find an \(\epsilon\) solution and only \(O((1+k)\sqrt{n}| \log \varepsilon| )\) if the problems has strictly feasible points.NEWLINENEWLINEFor the entire collection see [Zbl 0970.00036].
0 references