The following pages link to (Q2751323):
Displaying 3 items.
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- Semidefinite relaxation and new conditions for sign-definiteness of the quadratic form under quadratic constraints (Q1717053) (← links)
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation (Q2475315) (← links)