This paper considers a class of algorithms for solving quadratic programming problems. An attempt is made to rank the various procedures. Computational results are given and a discussion of the results is presented.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.