Mathematical Programming

On the complexity of quadratic programming with two quadratic constraints

Luca Consolini A, Marco Locatelli

Published Oct 1, 2016• 20 citations

Related papers

Approximating quadratic programming with bound and quadratic constraints

Yinyu Ye Y

Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems

Wen-Yang Ku, J. Christopher Beck

Quadratic convex reformulations for a class of complex quadratic programming problems

Cheng Zhu Lu, Gaojian Kang, Guangtai Qu +1 more

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint

Xiaojin Zheng, Yutong Pan, Xueting Cui

A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints

Yasutoshi Yajima, Tetsuya Fujie

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

Pierre Bonami, Oktay Günlük, Jeff Linderoth