Nothing
Active set method solver for the solution of indefinite quadratic programs, subject to lower bounds on linear functions of the variables and simple bounds on the variables themselves. The function QPmin() implements an algorithm similar to the one described in Gould (1991) <doi:10.1093/imanum/11.3.299> with the exception that an efficient sparse internal representation of the basis matrix is maintained thus allowing the solution of somewhat large problems.
Package details 


Author  Andrea Giusto 
Maintainer  Andrea Giusto <andrea.giusto@gmail.com> 
License  GPL (>= 2) 
Version  0.51 
Package repository  View on CRAN 
Installation 
Install the latest version of this package by entering the following in R:

Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.