An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints.
Cheng LuZhibin DengQingwei JinPublished in: J. Glob. Optim. (2017)
Keyphrases
- branch and bound algorithm
- inequality constraints
- equality constraints
- lower bound
- nonlinear programming
- branch and bound
- optimal solution
- upper bound
- combinatorial optimization
- np hard
- linear constraints
- objective function
- optimization problems
- mathematical program
- constraint satisfaction
- convex optimization
- max sat
- mathematical programming
- linear programming
- worst case
- neural network
- approximation algorithms
- least squares
- similarity measure