Title: Self-Tuning Data Adaptive Matrix Imputation
Description: Implements the AdaptiveImpute matrix completion
algorithm of 'Intelligent Initialization and Adaptive Thresholding for
AdaptiveImpute is useful for embedding sparsely observed matrices,
often out performs competing matrix completion algorithms, and
self-tunes its hyperparameter, making usage easy.
Imports: ellipsis, glue, logger, methods, Rcpp, RSpectra,
Suggests: invertiforms, covr, knitr, rmarkdown, testthat

Suggests: invertiforms, covr, knitr, rmarkdown, testthat (>= 3.0.0)

person('Turgut', 'Abdullayev', role = c('ctb', 'cre', 'cph', 'aut'),
Description: The 'fastai' <https://docs.fast.ai/index.html> library
simplifies training fast and accurate neural networks
using modern best practices. It is based on research
in to deep learning best practices undertaken
at 'fast.ai', including 'out of the box' support
for vision, text, tabular, audio, time series, and
Imports: reticulate, generics, png, ggplot2, ggpubr
Suggests: knitr, testthat, rmarkdown, curl, magrittr, data.table,
Packaged: 2020-11-05 18:26:03 UTC; turgutabdullayev
Author: Turgut Abdullayev [ctb, cre, cph, aut]

Imports: reticulate, generics, png, ggplot2, ggpubr, glue
Packaged: 2020-11-12 04:45:06 UTC; turgutabdullayev

vctrs, stats, utils, R.utils, nandb, viridis, zeallot
Packaged: 2020-12-09 10:55:54 UTC; turgutabdullayev

vctrs, stats, utils, R.utils, viridis, zeallot

Title: A fast solver for constrained l1 minimization approach to sparse
Author: Haotian Pang, Han Liu and Robert Vanderbei
Description: The package "fastclime" provides a method of recover the
precision matrix efficiently by applying parametric simplex
method.  The computation is based on a linear optimization

solver. It also contains a generic LP solver using parametric

Title: A fast solver for parameterized lp problems and constrained l1
minimization approach to sparse precision matrix estimation
solver. It also contains a generic LP solver and a parameterized LP solver using parametric simplex method.

Title: A Fast Solver for Parameterized Linear Programming Problems and
Constrained L1 Minimization Approach to Sparse Precision Matrix
Description: An efficient method of recovering precision matrices
by applying the parametric simplex method is provided in this package.
The computation is based on a linear optimization solver.
It also contains a generic Linear Programming solver and a
parameterized Linear Programming solver based on the parametric simplex method.