arXiv · 2610.27239
Combining Exponential and Polynomial Convergence Rates for Accelerated Extremum Seeking: A High-Order Lie Bracket Approach
Abstract
In this paper, we leverage the recently developed general higher-order Lie bracket approximation theory and framework for control-affine systems to show that we can design extremum seeking (ES) systems that combine flows based on: (i) first-order Lie bracket approximation, which provide an exponential convergence rate for quadratic objective functions and polynomial convergence rate for non-quadratic objective functions; and (ii) higher-order Lie bracket approximation, which provide exponential convergence rate near the minimizer even if the objective function is non-quadratic (i.e., flatter and possesses vanishing Hessian at the minimizer). Such combination provides an accelerated ES design that benefits from the polynomial decay rate farther away from the minimizer and exponential decay rate near the minimizer even for complicated nature of objective functions. We provide numerical simulations to demonstrate the results, including multi-variable and nonpolynomial flat-bottomed objective functions.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Victoria Grushkovskaya, Sameh Eisa. 2026-10-19. Combining Exponential and Polynomial Convergence Rates for Accelerated Extremum Seeking: A High-Order Lie Bracket Approach. https://searcharxiv.com/abs/2610.27239
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.