22 citations · 79 across the 19 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.OC2015★ 9 cited
Globally solving Non-Convex Quadratic Programs via Linear Integer Programming techniques
Wei Xia, Juan Vera, Luis F. Zuluaga
Quadratic programming (QP) is a well-studied fundamental NP-hard optimization problem which optimizes a quadratic objective over a set of linear constraints. In this paper, we refo…
math.OC2015
On the convergence rate of grid search for polynomial optimization over the simplex
Etienne de Klerk, Monique Laurent, Zhao Sun +1
We consider the approximate minimization of a given polynomial on the standard simplex, obtained by taking the minimum value over all rational grid points with given denominator ${…