An implementation of the majorization-minimization (MM) algorithm introduced by Xu, Chi, Yang, and Lange (2017) <arXiv:1612.05614> for solving multi-set split feasibility problems. In the multi-set split feasibility problem, we seek to find a point x in the intersection of multiple closed sets and whose image under a mapping also must fall in the intersection of several closed sets.
| Version: | 0.1.0 |
| Depends: | compiler, corpcor, matrixStats |
| Published: | 2018-04-11 |
| Author: | Eric C. Chi [aut, cre, cph], Jason Xu [ctb], Meng Yang [ctb], Kenneth Lange [ctb] |
| Maintainer: | Eric C. Chi <ecchi1105 at gmail.com> |
| License: | MIT + file LICENSE |
| NeedsCompilation: | no |
| Citation: | splitFeas citation info |
| CRAN checks: | splitFeas results |
| Reference manual: | splitFeas.pdf |
| Package source: | splitFeas_0.1.0.tar.gz |
| Windows binaries: | r-devel: splitFeas_0.1.0.zip, r-release: splitFeas_0.1.0.zip, r-oldrel: splitFeas_0.1.0.zip |
| macOS binaries: | r-release: splitFeas_0.1.0.tgz, r-oldrel: splitFeas_0.1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=splitFeas to link to this page.