Cross Post: For what it is worth I implemented a sort of priority queue which keeps track of local minima instead of a single global minimum. Keys are real priorities and a fix index set 1:n (coordinates). You need a graph to define which sense of “locally this coordinate is the next thing to work on” you want.
An advantage is that it allows parallelism (work on local minima which are separated enough to not interfere with each other). I made the structure thread safe in this sense.
For my usecase it’s working nicely … not sure if useful for others. I leave a demo and if you are interested I can explain a bit more.
Illustration: Changing the priority of two local minimum indices in a line graph changes some neighbouring indices into local minima.
