Time-delay Induced Stochastic Optimization and Extremum Seeking
Naum Dimitrieski, Michael Reyer, Mohamed-Ali Belabbas, Christian Ebenbauer
Abstract
In this paper a novel stochastic optimization and extremum seeking algorithm is presented, one which is based on time-delayed random perturbations and step size adaptation. For the case of a one-dimensional quadratic unconstrained optimization problem, global exponential convergence in expectation and global exponential practical convergence of the variance of the trajectories are proven. The theoretical results are complemented by numerical simulations for one- and multi-dimensional quadratic and non-quadratic objective functions.
