Using general triangle inequalities within quadratic convex reformulation method (Q6175568)
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 7716043
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using general triangle inequalities within quadratic convex reformulation method |
scientific article; zbMATH DE number 7716043 |
Statements
Using general triangle inequalities within quadratic convex reformulation method (English)
0 references
24 July 2023
0 references
quadratic convex relaxation
0 references
valid inequalities
0 references
global optimization
0 references
semi-definite programming
0 references
Lagrangian duality
0 references
sub-gradient algorithm
0 references
quadratic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7549868822097778
0 references
0.7525070905685425
0 references
0.7524756193161011
0 references
