Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (Q732130)
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 5612598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem |
scientific article; zbMATH DE number 5612598 |
Statements
Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem (English)
0 references
9 October 2009
0 references
The authors propose a class of polynomial interior-point algorithms for some horizontal linear complementarity problem based on a parametric kernel function. They analyze the interior-point algorithms using the uniformity of the kernel function. Also they develop some new analysis tools that are used in the complexity analysis of the algorithms and derive the currently best known iteration bounds for the algorithms with large and small update methods are presented.
0 references
horizontal linear complementarity problem
0 references
kernel function
0 references
interior-point methods
0 references
iteration bounds
0 references
numerical examples
0 references
algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.926854968070984
0 references
0.9251614212989808
0 references
0.9247646331787108
0 references
0.9088236093521118
0 references
