Found 1684 packages in 0.02 seconds
Computation of Optimal Transport Plans and Wasserstein Distances
Solve optimal transport problems. Compute Wasserstein distances (a.k.a. Kantorovitch, Fortet--Mourier, Mallows, Earth Mover's, or minimal L_p distances), return the corresponding transference plans, and display them graphically. Objects that can be compared include grey-scale images, (weighted) point patterns, and mass vectors.
Solve Nonlinear Optimization with Nonlinear Constraints
Optimization for nonlinear objective and constraint functions. Linear or nonlinear equality and inequality constraints are allowed. It accepts the input parameters as a constrained matrix.
Limited-memory BFGS Optimization
A wrapper built around the libLBFGS optimization library by Naoaki Okazaki. The lbfgs package implements both the Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) and the Orthant-Wise Quasi-Newton Limited-Memory (OWL-QN) optimization algorithms. The L-BFGS algorithm solves the problem of minimizing an objective, given its gradient, by iteratively computing approximations of the inverse Hessian matrix. The OWL-QN algorithm finds the optimum of an objective plus the L1-norm of the problem's parameters. The package offers a fast and memory-efficient implementation of these optimization routines, which is particularly suited for high-dimensional problems.
Evolutionary Multiobjective Optimization Algorithms
Collection of building blocks for the design and analysis of evolutionary multiobjective optimization algorithms.
An Alternative Advanced Normalization Tools ('ANTs')
Provides portable access from 'R' to biomedical image processing toolbox
'ANTs' by Avants et al. (2009)
Multivariate and Propensity Score Matching with Balance Optimization
Provides functions for multivariate and propensity score matching
and for finding optimal balance based on a genetic search algorithm.
A variety of univariate and multivariate metrics to
determine if balance has been obtained are also provided. For
details, see the paper by Jasjeet Sekhon
(2007,
Single and Multi-Objective Optimization Test Functions
Provides generators for a high number of both single- and multi- objective test functions which are frequently used for the benchmarking of (numerical) optimization algorithms. Moreover, it offers a set of convenient functions to generate, plot and work with objective functions.
Helpers for Parameters in Black-Box Optimization, Tuning and Machine Learning
Functions for parameter descriptions and operations in black-box optimization, tuning and machine learning. Parameters can be described (type, constraints, defaults, etc.), combined to parameter sets and can in general be programmed on. A useful OptPath object (archive) to log function evaluations is also provided.
Interface to the SCIP Optimization Suite
Provides an R interface to SCIP (Solving Constraint Integer Programs), a framework for mixed-integer
programming (MIP), mixed-integer nonlinear programming (MINLP), and constraint integer programming
(2025,
Genetic Algorithms
Flexible general-purpose toolbox implementing genetic
algorithms (GAs) for stochastic optimisation. Binary, real-valued, and
permutation representations are available to optimize a fitness
function, i.e. a function provided by users depending on their
objective function. Several genetic operators are available and can be
combined to explore the best settings for the current task.
Furthermore, users can define new genetic operators and easily
evaluate their performances. Local search using general-purpose
optimisation algorithms can be applied stochastically to exploit
interesting regions. GAs can be run sequentially or in parallel, using
an explicit master-slave parallelisation or a coarse-grain islands
approach. For more details see Scrucca (2013)