Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs.
Xiaowei BaoNikolaos V. SahinidisMohit TawarmalaniPublished in: Optim. Methods Softw. (2009)
Keyphrases
- quadratically constrained quadratic
- convex optimization
- interior point methods
- convex sets
- semidefinite programming
- semi infinite
- low rank
- nonlinear programming
- primal dual
- kernel learning
- linear programming
- semidefinite program
- convex relaxation
- linear program
- total variation
- semidefinite
- semi definite programming
- variational inequalities
- dynamic programming
- optimization problems
- convex hull
- objective function
- machine learning