A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (Q611277)
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 5826318
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems |
scientific article; zbMATH DE number 5826318 |
Statements
A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems (English)
0 references
14 December 2010
0 references
linear complementarity problems
0 references
feasible interior-point method
0 references
infeasible interior-point method
0 references
polynomial complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9261481761932372
0 references
0.909671425819397
0 references
0.9081761837005616
0 references
0.901926338672638
0 references
