# Iterative Bisector Method for finding the minimum of a non - differentiable function [closed]

I would like to automate a process to find the minimum of a non-differentiable function, perhaps using a similar system as the bisection method but adapted to finding minima instead of roots. Any ideas or tips on how to implement this or what functions to use would be greatly appreciated, thanks in advance.

• example of function? – AccidentalFourierTransform Feb 22 at 16:07
• Can you claim the minimum is a global one? Or that a local minima is good enough? – MikeY Feb 22 at 16:36
• A non-differentiable function could be very badly behaving. Look at the Weierstrass function, which is continuous everywhere but differentiable nowhere. There exist no methods that can handle such functions. – yarchik Feb 22 at 16:54
• Essentially i have a function which extracts an eigenvalue from a matrix and this eigenvalue is dependent on a parameter. I can plot the eigenvalue as a function of this parameter and see the minimum by eye but i get errors when using functions like findminimum because it cant differentiate it. – user63517 Feb 22 at 18:08
• @KJohn when using these functions, are you using the list of eigenvalues you have created? If so, then it should be easy to find the minimum – CA Trevillian Feb 24 at 13:42

M = {{1, x, 2}, {-1, 3, 2}, {2, 2, 5}};