Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs.
John E. MitchellJong-Shi PangBin YuPublished in: Optim. Methods Softw. (2014)
Keyphrases
- quadratically constrained quadratic
- convex quadratic
- inequality constraints
- convex optimization
- interior point methods
- semidefinite programming
- nonlinear programming
- linear programming
- optimality conditions
- semi infinite
- convex relaxation
- primal dual
- linear program
- semidefinite
- semidefinite program
- kernel learning
- semi definite programming
- objective function
- total variation
- quadratic programming
- low rank
- variational inequalities
- stationary points
- optimization problems
- computationally intensive
- mathematical program
- fixed point
- denoising
- optimal solution