  A constant-time solution of the continuous Global Optimization Problem (GOP)
is obtained by using an ensemble algorithm. We show that under certain
assumptions, the solution can be guaranteed by mapping the GOP onto a discrete
unsorted search problem, whereupon Bruschweiler's ensemble search algorithm is
applied. For adequate sensitivities of the measurement technique, the query
complexity of the ensemble search algorithm depends linearly on the size of the
function's domain. Advantages and limitations of an eventual NMR implementation
are discussed.
