New semidefinite relaxations for a class of complex quadratic programming problems.

Yingzhe Xu Cheng Lu Zhibin Deng Ya-Feng Liu

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

Keyphrases

semidefinite
semidefinite programming
quadratic programming problems
convex relaxation
convex sets
higher dimensional
finite dimensional
linear programming
sufficient conditions
interior point methods
feature extraction
objective function
training data
text classification
computationally intensive