Discrete and Global Optimization Routines

Documentation for package ‘adagio’ version 0.6.3

adagio-package	Discrete and Global Optimization
adagio	Discrete and Global Optimization
assignment	Linear Sum Assignment Problem
flineviz	Visualize Function Minimum
fminviz	Visualize Function Minimum
fnHald	Optimization Test Functions
fnNesterov	Optimization Test Functions
fnNesterov1	Optimization Test Functions
fnRastrigin	Optimization Test Functions
fnRosenbrock	Optimization Test Functions
fnShor	Optimization Test Functions
fnTrefethen	Trefethen and Wagon Test Functions
fnWagon	Trefethen and Wagon Test Functions
grHald	Optimization Test Functions
grNesterov	Optimization Test Functions
grRastrigin	Optimization Test Functions
grRosenbrock	Optimization Test Functions
grShor	Optimization Test Functions
hamiltonian	Finds a Hamiltonian path or cycle
knapsack	0-1 Knapsack Problem
lsqlincon	Linear Least-Squares Fitting with linear constraints
maxempty	Maximally Empty Rectangle Problem
maxquad	The MAXQUAD Test Function
maxsub	Maximal Sum Subarray
maxsub2d	Maximal Sum Subarray
mknapsack	Multiple 0-1 Knapsack Problem
nelmin	Nelder-Mead Minimization Method
nelminb	Nelder-Mead Minimization Method
pureCMAES	Covariance Matrix Adaptation Evolution Strategy
simpleDE	Simple Differential Evolution Algorithm
simpleEA	Simple Evolutionary Algorithm
subsetsum	Subset Sum Problem
transfinite	Boxed Region Transformation