A new extremum seeking design using high-order Lie bracket approximations achieves exponential convergence for polynomial-like cost functions of degree >2 without requiring Hessian information at the minimum.
100 years of extremum seeking: A survey
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A new perturb-and-observe algorithm uses uncertainty to perturb only when needed, converges under mild conditions, and outperforms standard P&O plus three other methods in PV solar simulations.
citing papers explorer
-
Extremum seeking with exponential convergence via high-order Lie bracket approximations
A new extremum seeking design using high-order Lie bracket approximations achieves exponential convergence for polynomial-like cost functions of degree >2 without requiring Hessian information at the minimum.
-
Uncertainty-based perturb and observe for data-driven optimization
A new perturb-and-observe algorithm uses uncertainty to perturb only when needed, converges under mild conditions, and outperforms standard P&O plus three other methods in PV solar simulations.