Simulated annealing

The secant method for root finding

1 | ```
secant(f, x, tol = 0.001, m = 100)
``` |

`f` |
function to integrate |

`x` |
an initial estimate of the root |

`tol` |
the error tolerance |

`m` |
the maximum number of iterations |

The secant method for root finding extends Newton's method to
estimate the derivative. It will return when the interval between
them is less than `tol`

, the error tolerance. However, this
implementation also stop if after `m`

iterations.

the real root found

Other optimz: `bisection`

,
`goldsect`

, `gradient`

,
`hillclimbing`

, `newton`

,
`sa`

1 2 |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.