Statistical characteristics of a simplex search with the aim drift

Abstract

The purpose of this research is to find and analyze statistical characteristics of a simplex search in a noisy surrounding and drifting aim conditions. The search process is described by using multiple Markov chains. Efficient simplex search algorithms for nonstationary object optimisation can be created on this investigation basis.