We have reduced the problem to a polynomial size QP, which, in principle, can be solved using standard QP toolkits.
although the number of variables and constraints in the factored dual is polynomial in the size of the data, the number of coefficients in the quadratic term in the objective is very large: quadratic in the number of sentences and dependent on the sixth power of sentence length.