Package: adagio 0.9.2
adagio: Discrete and Global Optimization Routines
The R package 'adagio' will provide methods and algorithms for (discrete) optimization, e.g. knapsack and subset sum procedures, derivative-free Nelder-Mead and Hooke-Jeeves minimization, and some (evolutionary) global optimization functions.
Authors:
adagio_0.9.2.tar.gz
adagio_0.9.2.zip(r-4.5)adagio_0.9.2.zip(r-4.4)adagio_0.9.2.zip(r-4.3)
adagio_0.9.2.tgz(r-4.4-any)adagio_0.9.2.tgz(r-4.3-any)
adagio_0.9.2.tar.gz(r-4.5-noble)adagio_0.9.2.tar.gz(r-4.4-noble)
adagio_0.9.2.tgz(r-4.4-emscripten)adagio_0.9.2.tgz(r-4.3-emscripten)
adagio.pdf |adagio.html✨
adagio/json (API)
NEWS
| # Install 'adagio' in R: |
| install.packages('adagio', repos = c('https://hwborchers.r-universe.dev', 'https://cloud.r-project.org')) |
This package does not link to any Github/Gitlab/R-forge repository. No issue tracker or development information is available.
Last updated 11 months agofrom:ff8105f5a4. Checks:OK: 7. Indexed: yes.
| Target | Result | Date |
|---|---|---|
| Doc / Vignettes | OK | Aug 21 2024 |
| R-4.5-win | OK | Aug 21 2024 |
| R-4.5-linux | OK | Aug 21 2024 |
| R-4.4-win | OK | Aug 21 2024 |
| R-4.4-mac | OK | Aug 21 2024 |
| R-4.3-win | OK | Aug 21 2024 |
| R-4.3-mac | OK | Aug 21 2024 |
Exports:assignmentbpp_approxchange_makingcountflinevizfminvizfnHaldfnNesterovfnNesterov1fnNesterov2fnRastriginfnRosenbrockfnShorfnTrefethenfnWagongrHaldgrNesterovgrRastrigingrRosenbrockgrShorhamiltonianHistorizehookejeevesknapsackmaxemptymaxquadmaxsubmaxsub2dmknapsackneldermeadneldermeadboccurspureCMAESsetcoversimpleDEsimpleEAsss_testsubsetsumtransfinite
Dependencies:lpSolve
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Linear Sum Assignment Problem | assignment |
| Approximate Bin Packing | bpp_approx |
| Change Making Problem | change_making |
| Covariance Matrix Adaptation Evolution Strategy | pureCMAES |
| Visualize Function Minimum | flineviz fminviz |
| Finds a Hamiltonian path or cycle | hamiltonian |
| Historize function | Historize |
| Hooke-Jeeves Minimization Method | hookejeeves |
| 0-1 Knapsack Problem | knapsack |
| Maximally Empty Rectangle Problem | maxempty |
| The MAXQUAD Test Function | maxquad |
| Maximal Sum Subarray | maxsub maxsub2d |
| Multiple 0-1 Knapsack Problem | mknapsack |
| Nelder-Mead Minimization Method | neldermead neldermeadb |
| Finding Subsequences | count occurs |
| Set cover problem | setcover |
| Trefethen and Wagon Test Functions | fnTrefethen fnWagon |
| Simple Differential Evolution Algorithm | simpleDE |
| Simple Evolutionary Algorithm | simpleEA |
| Subset Sum Problem | sss_test subsetsum |
| Optimization Test Functions | fnHald fnNesterov fnNesterov1 fnNesterov2 fnRastrigin fnRosenbrock fnShor grHald grNesterov grRastrigin grRosenbrock grShor |
| Boxed Region Transformation | transfinite |
