The presence of complementarity constraints brings a combinatorial flavour to an optimization problem. A quadratic programming problem with complementarity constraints can be relaxed to give a semidefinite programming problem. The solution to this relaxation can be used to generate feasible solutions to the complementarity constraints. A quadratic programming problem is solved for each of these feasible solutions and the best resulting solution provides an estimate for the optimal solution to the quadratic program with complementarity constraints. Computational testing of such an approach is described for a problem arising in portfolio optimization.
Math Sciences, RPI, Troy NY 12180, USA. http://www.rpi.edu/~mitchj/papers/sdpheur.html
View A semidefinite programming heuristic for quadratic programming problems with complementarity constraints