Solving Quadratic Programming by Cutting Planes (Q4634098)
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 7051464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving Quadratic Programming by Cutting Planes |
scientific article; zbMATH DE number 7051464 |
Statements
Solving Quadratic Programming by Cutting Planes (English)
0 references
7 May 2019
0 references
nonconvex programming
0 references
standard quadratic programming
0 references
global optimization
0 references
cutting planes
0 references
reformulation-linearization technique
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.91327566
0 references
0.89376056
0 references
0.8794357
0 references
0.87595534
0 references
0.87331164
0 references
