Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets.
Daniel BienstockAlexander MichalkaPublished in: SIAM J. Optim. (2014)
Keyphrases
- convex functions
- cutting plane
- exact penalty
- convex sets
- quasiconvex
- convex programming
- dc programming
- linear program
- objective function
- optimization problems
- cutting plane algorithm
- global optimization
- mixed integer
- integer program
- column generation
- integer programming
- lower bound
- piecewise linear
- primal dual
- knapsack problem
- constrained optimization
- valid inequalities
- optimization algorithm
- optimization model
- convex optimization
- variational inequalities
- nonlinear programming
- finite number
- branch and bound algorithm
- branch and bound
- utility function
- special case
- computational complexity