Solves quadratic programming problems using Richard L. Dykstra's cyclic projection algorithm. Routine allows for a combination of equality and inequality constraints. See Dykstra (1983) <doi:10.1080/01621459.1983.10477029> for details.
| Version: | 1.0-0 |
| Published: | 2018-02-09 |
| DOI: | 10.32614/CRAN.package.Dykstra |
| Author: | Nathaniel E. Helwig |
| Maintainer: | Nathaniel E. Helwig <helwig at umn.edu> |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| NeedsCompilation: | no |
| In views: | Optimization |
| CRAN checks: | Dykstra results |
| Reference manual: | Dykstra.pdf |
| Package source: | Dykstra_1.0-0.tar.gz |
| Windows binaries: | r-devel: Dykstra_1.0-0.zip, r-release: Dykstra_1.0-0.zip, r-oldrel: Dykstra_1.0-0.zip |
| macOS binaries: | r-release (arm64): Dykstra_1.0-0.tgz, r-oldrel (arm64): Dykstra_1.0-0.tgz, r-release (x86_64): Dykstra_1.0-0.tgz, r-oldrel (x86_64): Dykstra_1.0-0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=Dykstra to link to this page.