Markovian algorithms for estimating the global maximum or minimum of real valued functions defined on some domain Omega subset of R-d are presented. Conditions on the search schemes that preserve the asymptotic distribution are derived. Global and local search schemes satisfying these conditions are analysed and shown to yield sharper confidence intervals when compared to the i.i.d. case
This paper presents some simple technical conditions that guarantee the convergence of a general cla...
It is difficult to evaluate a random search algorithms, because regardless of a chosen method of eff...
Abstract. Improving Hit-and-Run is a random search algorithm for global optimization that at each it...
AbstractAn optimum random-search algorithm is considered. The convergence conditions to the greatest...
We consider a combination of state space partitioning and random search methods for solving determin...
A modified version of a common global optimization method named controlled random search is presente...
The goal of this article is to provide a general framework for locally convergent random-search algo...
Several Markov chain sampling algorithms, including the Hit-and-Run algorithm, are unified within th...
A theoretical technique for the minimization of a function by a random search is presented. The sear...
Controlled Random Search (CRS) is a simple population based algorithm which despite its attractivene...
We examine the conventional wisdom that commends the use of directe search methods in the presence o...
In this work we deal with the problem of finding an unconstrained global minimizer of a mul-tivariat...
This paper presents some simple technical conditions that guarantee the convergence of a general cla...
We consider global optimization problems, where the feasible region X is a compact subset of Rd ...
This book presents the main methodological and theoretical developments in stochastic global optimiz...
This paper presents some simple technical conditions that guarantee the convergence of a general cla...
It is difficult to evaluate a random search algorithms, because regardless of a chosen method of eff...
Abstract. Improving Hit-and-Run is a random search algorithm for global optimization that at each it...
AbstractAn optimum random-search algorithm is considered. The convergence conditions to the greatest...
We consider a combination of state space partitioning and random search methods for solving determin...
A modified version of a common global optimization method named controlled random search is presente...
The goal of this article is to provide a general framework for locally convergent random-search algo...
Several Markov chain sampling algorithms, including the Hit-and-Run algorithm, are unified within th...
A theoretical technique for the minimization of a function by a random search is presented. The sear...
Controlled Random Search (CRS) is a simple population based algorithm which despite its attractivene...
We examine the conventional wisdom that commends the use of directe search methods in the presence o...
In this work we deal with the problem of finding an unconstrained global minimizer of a mul-tivariat...
This paper presents some simple technical conditions that guarantee the convergence of a general cla...
We consider global optimization problems, where the feasible region X is a compact subset of Rd ...
This book presents the main methodological and theoretical developments in stochastic global optimiz...
This paper presents some simple technical conditions that guarantee the convergence of a general cla...
It is difficult to evaluate a random search algorithms, because regardless of a chosen method of eff...
Abstract. Improving Hit-and-Run is a random search algorithm for global optimization that at each it...