Package: optimizr 1.0.1

optimizr: Further Numerical Optimization Algorithms

A collection of numerical optimization algorithms. One is a simple implementation of the primitive grid search algorithm, the other is an extension of the simulated annealing algorithm that can take custom boundaries into account. The methodology for this bounded simulated annealing algorithm is due to Haario and Saksman (1991), <doi:10.2307/1427681>.

Authors:Lukas D Sauer [aut, cre]

optimizr_1.0.1.tar.gz
optimizr_1.0.1.zip(r-4.7)optimizr_1.0.1.zip(r-4.6)optimizr_1.0.1.zip(r-4.5)
optimizr_1.0.1.tgz(r-4.6-any)optimizr_1.0.1.tgz(r-4.5-any)
optimizr_1.0.1.tar.gz(r-4.7-any)optimizr_1.0.1.tar.gz(r-4.6-any)
optimizr_1.0.1.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
card.svg |card.png
optimizr/json (API)

# Install 'optimizr' in R:

install.packages('optimizr', repos = c('https://lukasdsauer.r-universe.dev', 'https://cloud.r-project.org'))

Bug tracker:https://github.com/lukasdsauer/optimizr/issues

On CRAN:

grid-search optimization-algorithms simulated-annealing

3.18 score 3 scripts 484 downloads 2 exports 8 dependencies

Last updated from:5d524c5593. Checks:9 OK. Indexed: yes.

Target	Result	Time
linux-devel-x86_64	OK	109
source / vignettes	OK	154
linux-release-x86_64	OK	107
macos-release-arm64	OK	105
macos-oldrel-arm64	OK	76
windows-devel	OK	75
windows-release	OK	72
windows-oldrel	OK	71
wasm-release	OK	92

Exports:gridsearch simann

Dependencies:codetools digest future future.apply globals listenv parallelly progressr

Citation

Development and contributors

Readme and manuals

Help Manual

Help page	Topics
Optimization algorithm	algorithm
Generate a candidate point in the neighborhood	genptry
Get names for the parameter vector	get_par_names
Grid Search Algorithm	gridsearch
Transform an interval to the unit interval	phi
Transform the unit interval to another interval	phiinv
Simulated Annealing Algorithm	simann