Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems (Q5501200)
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 6468815
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems |
scientific article; zbMATH DE number 6468815 |
Statements
Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (English)
0 references
3 August 2015
0 references
copositive matrices
0 references
nonconvex optimization
0 references
polynomial optimization
0 references
quadratically constrained problem
0 references
global optimality condition
0 references
approximation hierarchies
0 references
0 references
0 references
0 references
0 references
0 references
0.8269205689430237
0 references
0.8245598673820496
0 references
0.8125857710838318
0 references
0.8066391944885254
0 references
