Hi(adsbygoogle = window.adsbygoogle || []).push({});

I have some function f = f(x1,x2,...xn) over some domain [0,1]^n, and I'd like to find the global minimum. The function is *highly* non-linear and takes about 1 second to evaluate. I know it's positive because it's the sum of squares of about 1,000,000 arguments, each of which pretty much depends (non-linearly) on every single argument x1,x2...xn., where n ≈ 50; As a result I expect there to be a very large number of local minima.

Can anyone suggest a good approach to this problem? Standard minimum search algorithms get lost in a local minima or take forever calculating 50-D Jacobians.

Any suggestions?

Thanks

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Find global minimum of f(x1,x2, xn), with many local minima

Loading...

Similar Threads - Find global minimum | Date |
---|---|

B Find the missing energy value given a set of data (Hypothetical question) | Mar 3, 2018 |

I Find the height up a ladder where a dropped bottle will break, using only two bottles | Feb 6, 2018 |

B Using trig to find distance? | Jan 18, 2018 |

I Finding the explicit solution of a trig equation | Nov 21, 2017 |

What are the ODDS of 2 globally-influentially surnames at same time, minus 1 letter? | Jul 14, 2011 |

**Physics Forums - The Fusion of Science and Community**