On Nonconvex Quadratic Programming with Box Constraints

@article{Burer2009OnNQ,
  title={On Nonconvex Quadratic Programming with Box Constraints},
  author={Samuel Burer and Adam N. Letchford},
  journal={SIAM Journal on Optimization},
  year={2009},
  volume={20},
  pages={1073-1089}
}
Nonconvex quadratic programming with box constraints is a fundamental NP-hard global optimization problem. Recently, some authors have studied a certain family of convex sets associated with this problem. We prove several fundamental results concerned with these convex sets: we determine their dimension, characterize their extreme points and vertices, show their invariance under certain affine transformations, and show that various linear inequalities induce facets. We also show that the sets… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…