Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations

The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem

(2018) Immanuel M. Bomze et al.   MATHEMATICS OF OPERATIONS RESEARCH

A new branch-and-bound algorithm for standard quadratic programming problems

(2017) G. Liuzzi et al.   OPTIMIZATION METHODS & SOFTWARE

A Lagrangian–DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

(2015) Sunyoung Kim et al.   MATHEMATICAL PROGRAMMING

On the computational complexity of membership problems for the completely positive cone and its dual

(2013) Peter J. C. Dickinson et al.   COMPUTATIONAL OPTIMIZATION AND APPLICATIONS

An LPCC approach to nonconvex quadratic programs

(2010) Jing Hu et al.   MATHEMATICAL PROGRAMMING

Branching and bounds tighteningtechniques for non-convex MINLP

(2009) Pietro Belotti et al.   OPTIMIZATION METHODS & SOFTWARE

An Adaptive Linear Approximation Algorithm for Copositive Programs

(2009) Stefan Bundfuss et al.   SIAM JOURNAL ON OPTIMIZATION

A clique algorithm for standard quadratic programming

(2008) Andrea Scozzari et al.   DISCRETE APPLIED MATHEMATICS

On the Global Solution of Linear Programs with Linear Complementarity Constraints

(2008) Jing Hu et al.   SIAM JOURNAL ON OPTIMIZATION