A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (Q3176174)
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 6908287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A wide neighborhood arc-search interior-point algorithm for convex quadratic programming |
scientific article; zbMATH DE number 6908287 |
Statements
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming (English)
0 references
18 July 2018
0 references
arc-search
0 references
interior-point algorithm
0 references
polynomial complexity
0 references
convex quadratic programming
0 references
0 references
0 references
0 references
0 references
0.9340940713882446
0 references
0.9046021103858948
0 references
0.8700628876686096
0 references
0.8688084483146667
0 references
0.8529710173606873
0 references
