A discrete-time unbiased extremum seeking algorithm achieves exponential convergence for n-dimensional quadratic maps despite unknown large time-varying bounded delays by using dithers of frequency order sqrt(epsilon).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Extremum Seeking of Static Maps in the Presence of Unknown Large Time-Varying Delays
A discrete-time unbiased extremum seeking algorithm achieves exponential convergence for n-dimensional quadratic maps despite unknown large time-varying bounded delays by using dithers of frequency order sqrt(epsilon).