Feasible short-step interior point algorithm for linear complementarity problem based on kernel function (Q4614853)
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: Feasible short-step interior point algorithm for linear complementarity problem based on kernel function |
scientific article; zbMATH DE number 7009340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasible short-step interior point algorithm for linear complementarity problem based on kernel function |
scientific article; zbMATH DE number 7009340 |
Statements
31 January 2019
0 references
quadratic programming
0 references
convex nonlinear programming
0 references
interior point methods
0 references
0.8965965509414673
0 references
0.8868546485900879
0 references
0.88299560546875
0 references
0.8824164271354675
0 references
