Description Usage Details Value
Implements a variant of golden section search where the stepsize can be choosen freely.
1 |
Hence its is possible to trade robustness against computational effciency. This function is a closure that implements a cache for already calculated values and returns a function that can be used to find the global minimum numerically.
Returns a function with arguments split_candidates, left, mid, right, x, SegmentLossFUN, RecFUN, stepsize where RecFun should always be set to the object name of the function has been assigned so the function can call itself recursively.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.