Dual Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints.
Ivo NowakPublished in: J. Glob. Optim. (2000)
Keyphrases
- convex constraints
- quadratic program
- primal dual
- convex optimization
- linear program
- linear constraints
- lower bound
- optimal solution
- upper bound
- global consistency
- linear programming
- approximation algorithms
- maximum margin
- convex programming
- quadratic programming
- mixed integer
- objective function
- worst case
- semidefinite programming
- np hard
- convergence rate
- constraint networks
- path consistency
- computational complexity