QPmin: Linearly Constrained Indefinite Quadratic Program Solver

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.

Version: 0.5-1
Depends: R (≥ 3.1.0), Matrix, methods
Published: 2021-04-15
Author: Andrea Giusto
Maintainer: Andrea Giusto <andrea.giusto at gmail.com>
License: GPL-2 | GPL-3 [expanded from: GPL (≥ 2)]
NeedsCompilation: no
In views: Optimization
CRAN checks: QPmin results


Reference manual: QPmin.pdf
Package source: QPmin_0.5-1.tar.gz
Windows binaries: r-devel: QPmin_0.5-1.zip, r-release: QPmin_0.5-1.zip, r-oldrel: QPmin_0.5-1.zip
macOS binaries: r-release (arm64): QPmin_0.5-1.tgz, r-release (x86_64): QPmin_0.5-1.tgz, r-oldrel: QPmin_0.5-1.tgz


Please use the canonical form https://CRAN.R-project.org/package=QPmin to link to this page.