Abstract
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 Brüschweiler'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.
Original language | English |
---|---|
Pages (from-to) | L399-L407 |
Journal | Journal of Physics A: Mathematical and General |
Volume | 36 |
Issue number | 24 |
DOIs | |
State | Published - Jun 20 2003 |