We study the problem of approximating the global minimum for a class of twice-continuously differentiable functions defined on the unit interval. For an algorithm that uses only function values, we show that the loga- rithm of the reciprocal of the error is asymptotically of order n/log(n) after n function evaluations.
|Original language||English (US)|
|Title of host publication||Information And Complexity|
|Publisher||World Scientific Publishing Co.|
|Number of pages||13|
|State||Published - Jan 1 2016|
All Science Journal Classification (ASJC) codes
- Computer Science(all)