On sequential algorithms of accelerated hill climbing in plants with delays

Adaptive hill climbing algorithms are developed for $n$-th order plant with delays and sequential accumulation with and without drift. To reduce the delays accelerated methods are used such as forecasting the steady state value and measuring the discontinuity of the senior derivative. If there is no drift the comparative effectiveness of the algorithms designed is analyzed