On solving quadratically constrained quadratic programming problem with one non-convex constraint (Q1790405)
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: On solving quadratically constrained quadratic programming problem with one non-convex constraint |
scientific article; zbMATH DE number 6946278
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On solving quadratically constrained quadratic programming problem with one non-convex constraint |
scientific article; zbMATH DE number 6946278 |
Statements
On solving quadratically constrained quadratic programming problem with one non-convex constraint (English)
0 references
2 October 2018
0 references
adaptive ellipsoid based method
0 references
quadratically constrained quadratic programming
0 references
non-convex constraint
0 references
semidefinite programming
0 references
0 references
0 references
0 references
0 references
0 references
0.8440535068511963
0 references
0.816663920879364
0 references
0.8069543242454529
0 references
0.803228497505188
0 references
