A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs (Q5241637)
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: A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs |
scientific article; zbMATH DE number 7125330
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs |
scientific article; zbMATH DE number 7125330 |
Statements
1 November 2019
0 references
mixed linear complementarity problem
0 references
symmetric cone
0 references
interior-point methods
0 references
polynomial complexity
0 references
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs (English)
0 references
0 references
0 references
0 references
