The minorization-maximization (MM) algorithm is a powerful tool for maximizing nonconcave target function. However, for most existing MM algorithms, the surrogate function in the minorization step is constructed in a case-specific manner and requires manual programming. To address this limitation, we develop the R package MMAD, which systematically integrates the assembly–decomposition technology in the MM framework. This new package provides a comprehensive computational toolkit for one-stop inference of complex target functions, including function construction, evaluation, minorization and optimization via MM algorithm. By representing the target function through a hierarchical composition of assembly functions, we design a hierarchical algorithmic structure that supports both bottom-up operations (construction, evaluation) and top-down operation (minorization).
| Version: | 2.0.1 |
| Depends: | R (≥ 2.10) |
| Imports: | utils |
| Suggests: | testthat (≥ 3.0.0) |
| Published: | 2026-03-12 |
| DOI: | 10.32614/CRAN.package.MMAD |
| Author: | Xifen Huang [aut], Jinfeng Xu [aut], Jiaqi Gu [aut, cre] |
| Maintainer: | Jiaqi Gu <jiaqigu at usf.edu> |
| License: | GPL-3 |
| NeedsCompilation: | no |
| CRAN checks: | MMAD results |
| Reference manual: | MMAD.html , MMAD.pdf |
| Package source: | MMAD_2.0.1.tar.gz |
| Windows binaries: | r-devel: MMAD_2.0.1.zip, r-release: MMAD_2.0.zip, r-oldrel: MMAD_2.0.1.zip |
| macOS binaries: | r-release (arm64): MMAD_2.0.1.tgz, r-oldrel (arm64): MMAD_2.0.1.tgz, r-release (x86_64): MMAD_2.0.1.tgz, r-oldrel (x86_64): MMAD_2.0.1.tgz |
| Old sources: | MMAD archive |
Please use the canonical form https://CRAN.R-project.org/package=MMAD to link to this page.
Need a high-speed mirror for your open-source project?
Contact our mirror admin team at info@clientvps.com.
This archive is provided as a free public service to the community.
Proudly supported by infrastructure from VPSPulse , RxServers , BuyNumber , UnitVPS , OffshoreName and secure payment technology by ArionPay.