C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem.
Zi Xu
Siqi Tao
Kaiyao Lou
Published in:
Optim. Lett. (2019)
Keyphrases
</>
semidefinite
interior point methods
convex sets
lower bound
semidefinite programming
upper bound
convex optimization
objective function
sufficient conditions
finite number
optimization problems
quadratic programming
convex relaxation
finite dimensional