Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (Q1760104)
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: Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem |
scientific article; zbMATH DE number 6104867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem |
scientific article; zbMATH DE number 6104867 |
Statements
Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem (English)
0 references
12 November 2012
0 references
The authors propose two Mehrotra-type predictor-corrector algorithms for sufficient horizontal linear complementarity problems in the minus-infinity neighborhood of the central path. Both of the algorithms are independent on the handicap \(\chi\) of the problems, and enjoy \(O(n(1+\chi) \log((x^0)^T s^0/\epsilon))\) iteration complexity. Some preliminary numerical results are provided to demonstrate the efficiency and reliability of the proposed algorithms.
0 references
linear complementarity problem
0 references
interior-point method
0 references
mehrotra-type algorithm
0 references
predictor-corrector algorithm
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8683347702026367
0 references
0.8627482056617737
0 references
0.8573389649391174
0 references
