A decomposition method for nonconvex quadratically constrained quadratic programs.
Chuangchuang SunRan DaiPublished in: ACC (2017)
Keyphrases
- decomposition method
- convex optimization
- quadratically constrained quadratic
- decomposition methods
- decomposition algorithm
- interior point methods
- semidefinite programming
- semidefinite program
- optimization problems
- kernel learning
- nonlinear programming
- image processing
- feature extraction
- objective function
- primal dual
- semi infinite