Constant-time solution to the global optimization problem using Brüschweiler's ensemble search algorithm

V. Protopopescu, C. D'Helon, J. Barhen

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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 languageEnglish
Pages (from-to)L399-L407
JournalJournal of Physics A: Mathematical and General
Volume36
Issue number24
DOIs
StatePublished - Jun 20 2003

Fingerprint

Dive into the research topics of 'Constant-time solution to the global optimization problem using Brüschweiler's ensemble search algorithm'. Together they form a unique fingerprint.

Cite this