On the complexity of approximating a KKT point of quadratic programming (Q1380927)
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 1127719
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of approximating a KKT point of quadratic programming |
scientific article; zbMATH DE number 1127719 |
Statements
On the complexity of approximating a KKT point of quadratic programming (English)
0 references
7 September 1998
0 references
quadratic programming
0 references
KKT point
0 references
local minimizer
0 references
potential reduction algorithm
0 references
fully polynomial-time approximation scheme
0 references
0 references
0 references
0.7786691188812256
0 references
0.762728750705719
0 references
0.7613324522972107
0 references
0.7571709752082825
0 references
