Pub. online:1 Jan 1991Type:Research ArticleOpen Access
Volume 2, Issue 3 (1991), pp. 352–366
Error bounds are developed for a class of quadratic programming problems. The absolute error between an approximate feasible solution, generated via a dual formulation, and the true optimal solution is measured. Furthermore, these error bounds involve considerably less work computationally than existing estimates.