Mathematical Programming Computation

A primal–dual regularized interior-point method for convex quadratic programs
Fast Fourier optimization
Globally solving nonconvex quadratic programming problems via completely positive programming
Rounding-based heuristics for nonconvex MINLPs