A n-dimensional generalization of the golden search method.

Abstract

I generalize the 1-dimensional golden search method to solve optimization problems in economics. I show that the rate of convergence is the same as the standard golden search method. Therefore, the algorithm is capable to handle several decision variables and is robust to corner solutions. The algorithm is fast an accurate.