Found 1684 packages in 0.02 seconds
Optimal, Fast, and Reproducible Univariate Clustering
Fast, optimal, and reproducible univariate
clustering by dynamic programming. Four problems are solved, including
univariate k-means (Wang & Song 2011)
A Replacement and Extension of the 'optim' Function
Provides a test of replacement and extension of the optim() function to unify and streamline optimization capabilities in R for smooth, possibly box constrained functions of several or many parameters. This version has a reduced set of methods and is intended to be on CRAN.
Multiple Criteria Optimization Algorithms and Related Functions
A collection of function to solve multiple criteria optimization problems using genetic algorithms (NSGA-II). Also included is a collection of test functions.
Model and Solve Mixed Integer Linear Programs
Model mixed integer linear programs in an algebraic way directly in R. The model is solver-independent and thus offers the possibility to solve a model with different solvers. It currently only supports linear constraints and objective functions. See the 'ompr' website < https://dirkschumacher.github.io/ompr/> for more information, documentation and examples.
Limited Memory BFGS Minimizer with Bounds on Parameters with optim() 'C' Interface
Interfacing to Nocedal et al. L-BFGS-B.3.0 (See < http://users.iems.northwestern.edu/~nocedal/lbfgsb.html>) limited memory BFGS minimizer with bounds on parameters. This is a fork of 'lbfgsb3'. This registers a 'R' compatible 'C' interface to L-BFGS-B.3.0 that uses the same function types and optimization as the optim() function (see writing 'R' extensions and source for details). This package also adds more stopping criteria as well as allowing the adjustment of more tolerances.
Flexible Bayesian Optimization
A modern and flexible approach to Bayesian Optimization / Model
Based Optimization building on the 'bbotk' package. 'mlr3mbo' is a toolbox
providing both ready-to-use optimization algorithms as well as their fundamental
building blocks allowing for straightforward implementation of custom
algorithms. Single- and multi-objective optimization is supported as well as
mixed continuous, categorical and conditional search spaces. Moreover, using
'mlr3mbo' for hyperparameter optimization of machine learning models within the
'mlr3' ecosystem is straightforward via 'mlr3tuning'. Examples of ready-to-use
optimization algorithms include Efficient Global Optimization by Jones et al.
(1998)
Bayesian Optimization and Model-Based Optimization of Expensive Black-Box Functions
Flexible and comprehensive R toolbox for model-based optimization ('MBO'), also known as Bayesian optimization. It implements the Efficient Global Optimization Algorithm and is designed for both single- and multi- objective optimization with mixed continuous, categorical and conditional parameters. The machine learning toolbox 'mlr' provide dozens of regression learners to model the performance of the target algorithm with respect to the parameter settings. It provides many different infill criteria to guide the search process. Additional features include multi-point batch proposal, parallel execution as well as visualization and sophisticated logging mechanisms, which is especially useful for teaching and understanding of algorithm behavior. 'mlrMBO' is implemented in a modular fashion, such that single components can be easily replaced or adapted by the user for specific use cases.
Approximate Optimal Transport Between Two-Dimensional Grids
Can be used for optimal transport between two-dimensional grids with respect to separable cost functions of l^p form. It utilizes the Frank-Wolfe algorithm to approximate so-called pivot measures: One-dimensional transport plans that fully describe the full transport, see G. Auricchio (2023)
General Purpose Optimization in R using C++
Perform general purpose optimization in R using C++. A unified wrapper interface is provided to call C functions of the five optimization algorithms ('Nelder-Mead', 'BFGS', 'CG', 'L-BFGS-B' and 'SANN') underlying optim().
Approximate String Matching, Fuzzy Text Search, and String Distance Functions
Implements an approximate string matching version of R's native
'match' function. Also offers fuzzy text search based on various string
distance measures. Can calculate various string distances based on edits
(Damerau-Levenshtein, Hamming, Levenshtein, optimal sting alignment), qgrams (q-
gram, cosine, jaccard distance) or heuristic metrics (Jaro, Jaro-Winkler). An
implementation of soundex is provided as well. Distances can be computed between
character vectors while taking proper care of encoding or between integer
vectors representing generic sequences. This package is built for speed and
runs in parallel by using 'openMP'. An API for C or C++ is exposed as well.
Reference: MPJ van der Loo (2014)