A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation.
Hezhi LuoSikai ChenHuixian WuPublished in: Numer. Algorithms (2021)
Keyphrases
- dynamic programming
- objective function
- optimization algorithm
- convex quadratic programming
- computational complexity
- semidefinite
- probabilistic model
- optimization method
- convergence rate
- distance function
- distance metric
- worst case
- semidefinite programming
- np hard
- learning algorithm
- bayesian framework
- higher dimensional
- convex relaxation
- image processing