An Interval Algorithm for Quadratic Programming
Zhang Yan · 2005
In this paper ,we transform the quadratic programming problem to an unconstrained optimization problem with the idea of penalty function methods ,discuss the interval extensions of the penalty functions and the test rules of region deletion .At last,we design an interval algorithm .Numerical results show the algorithm is reliable and efficient.