Event-Triggered Newton Extremum Seeking for Multivariable Optimization
Victor Hugo Pereira Rodrigues, Tiago Roux Oliveira, Miroslav Krstic, Paulo Tabuada
TL;DR
The paper addresses the slow and curvature-dependent convergence of multivariable gradient-based extremum seeking by introducing a static event-triggered Newton-based approach. It uses a Riccati-based estimator to dynamically compute the inverse Hessian $H^{*-1}$ via the update law $\dot{\Gamma}=\omega_r\Gamma-\omega_r\widehat{H}^{\!*}(t)\Gamma$, yielding a Newton-like controller $u(t)=-K\Gamma(t)\hat{G}(t)$ whose convergence rate can be tuned independently of the unknown curvature. Stability is established through averaging theory for discontinuous systems, proving local exponential practical stability and precluding Zeno behavior, while the event-triggered mechanism significantly reduces control updates. Numerical results demonstrate faster convergence and up to an 8x reduction in actuation frequency compared with gradient-based ES, highlighting the practical benefits for real-time, resource-constrained optimization in networked or embedded systems.
Abstract
This paper presents a static event-triggered control strategy for multivariable Newton-based extremum seeking. The proposed method integrates event-triggered actuation into the Newton-based optimization framework to reduce control updates while maintaining rapid convergence to the extremum. Unlike traditional gradient-based extremum seeking, where the convergence rate depends on the unknown Hessian of the cost function, the proposed approach employs a dynamic estimator of the Hessian inverse, formulated as a Riccati equation, enabling user-assignable convergence rates. The event-triggering mechanism is designed to minimize unnecessary actuation updates while preserving stability and performance. Using averaging theory, we establish local stability results and exponential convergence to a neighborhood of the unknown extremum point. Additionally, numerical simulations illustrate the benefits of the proposed approach over gradient-based and continuously actuated Newton-based extremum seeking, showing improved convergence rates and reduced control update frequency, leading to more efficient implementation in real-time optimization scenarios.
