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

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… (More)

Topics

  • Presentations referencing similar topics