Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints.

Xinzhen Zhang Chen Ling Liqun Qi

Published in: J. Glob. Optim. (2011)

Keyphrases

semidefinite
semidefinite programming
monotonicity property
quadratic optimization problems
convex relaxation
sufficient conditions
interior point methods
higher dimensional
convex sets
worst case
lower bound
upper bound
learning algorithm
computational complexity