Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200)
From MaRDI portal
scientific article; zbMATH DE number 6468815
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
