An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem (Q279835)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6575208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem |
scientific article; zbMATH DE number 6575208 |
Statements
An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem (English)
0 references
29 April 2016
0 references
linear complementarity problem
0 references
interior-point methods
0 references
wide neighborhood
0 references
Mehrotra-type predictor-corrector algorithm
0 references
polynomial complexity
0 references
0 references
0 references
0.9019367694854736
0 references
0.8905733227729797
0 references
0.8725540041923523
0 references
0.8700607419013977
0 references
