I wonder if somebody could quickly and briefly outline some of the similarities and differences between the line search methods Golden Section Search, Fibonacci Search and Dichotomic Search.

I know Dichotomous has two functional evaluations per iteration whereas the other two only one, and that the Fibonacci search tends to the Golden Section as the number of functional evaluates tends to infinity. I know also that you have to predetermine the number of functional evaluates for Fibonacci. Are there other, similar techniques?

  • 2
    $\begingroup$ Some links or more complete descriptions would help make your question clearer. $\endgroup$ – Dave Clarke May 14 '12 at 20:09
  • 1
    $\begingroup$ en.wikipedia.org/wiki/Fibonacci_search_technique explains some of the differences. $\endgroup$ – Dave Clarke May 14 '12 at 20:10
  • $\begingroup$ Why delete my comments $\endgroup$ – rk101 May 14 '12 at 21:21
  • $\begingroup$ only moderators (users with diamond near their username) can delete other people's comments, and they do so when the comments are not relevant to the question. Please see the FAQ and general SE FAQ entry about comments. $\endgroup$ – Kaveh May 14 '12 at 23:28
  • $\begingroup$ This question seems to be too broad. Please understand the individual techniques first (and ask focused questions if necessary); you should then be able to compare yourself. If there are problems with the details, you can focus your question. $\endgroup$ – Raphael May 15 '12 at 9:24

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.