bisec_optim | R Documentation |
bisec_optim()
found parameters which minimize target function in a given space
bisec_optim(fun, space, partition, times, trim, enlarge)
fun |
function. the function to be optimized, i.e. find minimal value. |
space |
numeric matrix. n*2 matrix, where n is the number of
parameters to fit. |
partition |
integer scalar. how partitions are the original range divided per parameter. |
times |
integer scalar. how many times should the initial range be partitioned. |
trim |
numeric scalar. must be positive, determine what proportion of total subranges will
be reserved for the next round of partition. Let |
enlarge |
integer scalar. how many times is the selected subrange enlarged before the next round of partition. |
see paras.
list.
value, numeric saclar. smallest function value found
para, numeric vector. best parameters.
space, numeric matrix. best solution space.
1. partition can be a integer vector, i.e. different parameter can be partitioned for different times
bisec_optim(sum, matrix(c(0,1,0,1,0,1), 3, byrow = T), 3, 10, 4, 1) bisec_optim(sum, matrix(c(0,1,0,1,0,1), 3, byrow = T), 3, 10, 1/3, 1)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.