I was wondering if anyone has any suggestions for reducing the function, F (X, Y), where x And y are integers. I've discovered very little amounts and optimization techniques, like outside BFGs and other GSLs, and things beyond numerical recipes. So far, I have tried to implement several different schemes. First task by selecting the direction of the largest number F (X + 1, Y), F (X-1, Y), F (X, Y + 1), F (X, Y-1) and following that direction With line reduction, I have also tried to use a downhill simple (nyled-mead) method, both ways stay far away from a minimum, they work on both simple tasks, such as finding at least paraboloid, but I It seems that both, and especially Pu W, are designed for those tasks where x and y real value (doubles). Another problem is that I have to call F (X, Y) as a while. It talks to external hardware, and takes a few seconds for each call. Any ideas for this will be highly appreciated. Here is an example of the error function. Sorry, I did not ...