Found 1684 packages in 0.04 seconds
C++ Header Files for Stan
The C++ header files of the Stan project are provided by this package, but it contains little R code or documentation. The main reference is the vignette. There is a shared object containing part of the 'CVODES' library, but its functionality is not accessible from R. 'StanHeaders' is primarily useful for developers who want to utilize the 'LinkingTo' directive of their package's DESCRIPTION file to build on the Stan library without incurring unnecessary dependencies. The Stan project develops a probabilistic programming language that implements full or approximate Bayesian statistical inference via Markov Chain Monte Carlo or 'variational' methods and implements (optionally penalized) maximum likelihood estimation via optimization. The Stan library includes an advanced automatic differentiation scheme, 'templated' statistical and linear algebra functions that can handle the automatically 'differentiable' scalar types (and doubles, 'ints', etc.), and a parser for the Stan language. The 'rstan' package provides user-facing R functions to parse, compile, test, estimate, and analyze Stan models.
Bayesian Optimization of Hyperparameters
A Pure R implementation of Bayesian Global Optimization with Gaussian Processes.
Numerical Methods and Optimization in Finance
Functions, examples and data from the first and the second edition of "Numerical Methods and Optimization in Finance" by M. Gilli, D. Maringer and E. Schumann (2019, ISBN:978-0128150658). The package provides implementations of optimisation heuristics (Differential Evolution, Genetic Algorithms, Particle Swarm Optimisation, Simulated Annealing and Threshold Accepting), and other optimisation tools, such as grid search and greedy search. There are also functions for the valuation of financial instruments such as bonds and options, for portfolio selection and functions that help with stochastic simulations.
Functions for Optimal Matching
Distance based bipartite matching using minimum cost flow, oriented
to matching of treatment and control groups in observational studies ('Hansen'
and 'Klopfer' 2006
Active Set and Generalized PAVA for Isotone Optimization
Contains two main functions: one for solving general isotone regression problems using the pool-adjacent-violators algorithm (PAVA); another one provides a framework for active set methods for isotone optimization problems with arbitrary order restrictions. Various types of loss functions are prespecified.
Multi-Objective Optimization in R
The 'rmoo' package is a framework for multi- and many-objective
optimization, which allows researchers and users versatility
in parameter configuration, as well as tools for analysis, replication
and visualization of results. The 'rmoo' package was built as a fork of
the 'GA' package by Luca Scrucca(2017)
Implementation of Artificial Bee Colony (ABC) Optimization
An implementation of Karaboga (2005) Artificial Bee Colony Optimization algorithm < http://mf.erciyes.edu.tr/abc/pub/tr06_2005.pdf>. This (working) version is a Work-in-progress, which is why it has been implemented using pure R code. This was developed upon the basic version programmed in C and distributed at the algorithm's official website.
Differential Evolution Optimization in Pure R
Differential Evolution (DE) stochastic heuristic algorithms for
global optimization of problems with and without general constraints.
The aim is to curate a collection of its variants that
(1) do not sacrifice simplicity of design,
(2) are essentially tuning-free, and
(3) can be efficiently implemented directly in the R language.
Currently, it provides implementations of the algorithms 'jDE' by
Brest et al. (2006)
Functions for Optimal Non-Bipartite Matching
Perform non-bipartite matching and matched randomization. A "bipartite" matching utilizes two separate groups, e.g. smokers being matched to nonsmokers or cases being matched to controls. A "non-bipartite" matching creates mates from one big group, e.g. 100 hospitals being randomized for a two-arm cluster randomized trial or 5000 children who have been exposed to various levels of secondhand smoke and are being paired to form a greater exposure vs. lesser exposure comparison. At the core of a non-bipartite matching is a N x N distance matrix for N potential mates. The distance between two units expresses a measure of similarity or quality as mates (the lower the better). The 'gendistance()' and 'distancematrix()' functions assist in creating this. The 'nonbimatch()' function creates the matching that minimizes the total sum of distances between mates; hence, it is referred to as an "optimal" matching. The 'assign.grp()' function aids in performing a matched randomization. Note bipartite matching can be performed using the prevent option in 'gendistance()'.
'Rcpp' Integration for Numerical Computing Libraries
A collection of open source libraries for numerical computing (numerical integration, optimization, etc.) and their integration with 'Rcpp'.