1. Rigorous convex underestimators for general twice-differentiable problems;Claire S Adjiman;Journal of Global Optimization,1996
2. Jointly constrained biconvex programming;Al-Khayyal Faiz;Mathematics of Operations Research,1983
3. Algorithms for polynomials in Bernstein form;T Rida;Computer Aided Geometric Design,1988
4. A comparison of methods for the computation of affine lower bound functions for polynomials;J�rgen Garloff;Global Optimization and Constraint Satisfaction,2003