WorksMathematics
Small-Gain Analysis of Robust Event-Triggered Extremum Seeking for Scalar Maps
Abstract
We study a sample-and-hold implementation of gradient extremum seeking for a scalar quadratic map in which the control signal is refreshed only when an event occurs. The event generator acts on the demodulated gradient signal as it is actually measured, rather than on its averaged version, and contains a strictly positive offset, following the small-gain philosophy for robust event-triggered control. Rather than invoking averaging theorems, we work directly with the exact dynamics of the parameter estimation error. In the scalar setting, the demodulated gradient has an explicit sinusoidal structure, which is exploited through a change of variables that absorbs the zero-mean oscillatory perturbation, together with a quadratic Lyapunov function and the persistence of excitation of the probing signal. For a sufficiently fast dither, the estimation error is shown to decay exponentially to a residual neighborhood of the origin whose size is quantified by the dither amplitude and frequency, and by the relative threshold and the offset of the event generator. All constants, including the input-to-state stability gain of the extremum seeking loop, the admissible dither frequency and the positive lower bound on the time between two consecutive events, are given in closed form, so that Zeno behavior is excluded. A simulation example illustrates the results.
Introduction
Extremum seeking (ES) is a non-model-based adaptive technique that drives the input of an uncertain map toward the point where the output is optimal, using nothing more than output measurements and a periodic probing signal [1, 2, 3]. After the stability proof in [2], the method has been extended in several directions, including multi-parameter and Newton-type schemes [4], maps with delays and distributed-parameter actuation [5, 6], and applications such as source seeking with autonomous vehicles [7].
When the optimizer runs on an embedded or networked platform, refreshing the control input continuously or at a fixed fast rate squanders bandwidth and processor time. Event-triggered control replaces time-driven updates by state-driven ones: the actuator value is recomputed only when a prescribed triggering condition fails [8, 9]. The idea has been developed, among many other settings, for nonlinear systems with dynamic triggers [10]. Bringing event-triggered updates into ES is more recent: the gradient scheme of [11] was followed by a Newton-type version [12], by a discrete-time multivariable formulation [13], and by game-theoretic settings in which several players seek a Nash equilibrium [14]. All of these works share one methodological choice: the trigger is designed on the average model, and the behavior of the true oscillating loop is inferred afterwards from averaging theorems.
Here we take a different path, motivated by the small-gain approach to robust event-triggered control of nonlinear systems [15, 16], which rests on input-to-state stability (ISS) and on the small-gain theory for interconnections [17]. We regard the event-triggered ES loop as the feedback interconnection of two blocks: the dynamics of the parameter estimation error, and the event generator. The sampling error and the oscillations produced by the dither enter this interconnection as disturbances. We focus on the scalar (single-input) case, for which the demodulated gradient admits a fully explicit sinusoidal decomposition and all the constants of the analysis can be written in closed form. The contributions are:
a static triggering rule with a positive offset, evaluated on the measured gradient estimate itself (not on its average), which tolerates the persistent oscillatory perturbations that are intrinsic to ES;
an ISS estimate of the ES dynamics with respect to the sampling error, derived on the exact error equation, without averaging, through the sign structure and the persistence of excitation of the demodulated gradient;
a small-gain condition coupling the ISS gain of the ES dynamics with the gain of the event generator, which yields local exponential practical stability and an explicit residual set;
a closed-form, uniform lower bound on the inter-event times, which rules out Zeno behavior.
The results are the scalar specialization of a multivariable theory developed by the authors; in the scalar case the extra assumptions on probing frequencies and gain structure disappear and every constant becomes transparent.
Notation: is the absolute value, the sign function and . For a function and an interval , .
Problem Statement
We consider the scalar static map
where is the input that can be manipulated in real time, is the measured output, is the optimizer, is the optimal value and is the curvature (second derivative) of the map.
Assumption 1: The constants , and are unknown, but and is known.
Since any smooth map with a nondegenerate extremum agrees with (1) up to second order near , the quadratic model captures the local behavior of general scalar ES problems while keeping the demodulated signal explicitly computable. When the task is to minimize , and when the task is to maximize it; in both cases must be steered to a small vicinity of . We write
Event-Triggered Extremum Seeking
Probing, Demodulation and Error Variable
The scheme is depicted in Figure 1. A single sinusoid is used both to perturb the input and to demodulate the output [3]:
Figure 1. Robust event-triggered extremum seeking for a scalar map. The event generator monitors the measured gradient estimate and releases a new sample to the zero-order hold (ZOH) only when the triggering condition is violated.
with period
The dither is superimposed on the current estimate of the optimizer, , where is the state of an integrator. With the estimation error
one has and, from (1),
Structure of the Gradient Estimate
The gradient estimate is obtained by demodulation,
Multiplying (6) by and using the identities and , we arrive at the exact decomposition
where
The first term in (8) is the useful part of the estimate: it is linear in and its coefficient has the sign of and average value over one period. The term is quadratic in the error and vanishes at . The term does not depend on and does not vanish: it is a persistent oscillation generated by the dither and by the offset of the map. From (11),
Moreover, since and ,
The next lemma gathers the three properties of the probing signal on which the whole analysis rests.
Lemma 1: For all , the following statements hold.
(i) (Sign structure) and .
(ii) (Persistence of excitation) .
(iii) (Bounded primitive) The -periodic zero-mean primitive of , namely
satisfies and
Proof: Items (i) and (ii) follow from and from , since . Item (iii) is obtained by integrating each sinusoid in (11) termwise and bounding , so that .
Items (i) and (ii) state that the instantaneous adaptation gain never has the wrong sign and has a strictly positive mean; together they replace the averaging step of the classical analysis.
Sample-and-Hold Emulation
The adaptation gain is a scalar with
so that : a negative gain is used for minimization and a positive one for maximization. The estimator is the integrator and, since is constant, . The continuous-time law is emulated with a zero-order hold: the control value is recomputed only at the instants , , delivered by the event generator,
The mismatch between the held and the current estimates is the sampling error
Collecting (8), (18) and (19), the estimation error obeys, on each interval ,
where the lumped input
collects the sampling error, which is shaped by the event generator, and the quadratic term, which vanishes at the origin. (20) is exact. Observe that appears twice: inside , where it drives the error, and inside , which is the signal the event generator watches.
Triggering Rule with Offset
Because does not vanish at , neither does ; in fact crosses zero at every half period. A purely relative rule of the form would therefore force events to accumulate near those zero crossings. This is avoided by adding a positive offset, in the spirit of [16 Sec. 3.4.1].
Definition 1 (Static event generator with offset): Given and , the sequence of event times is defined by and
with the convention when the set is empty. At each the control value (18) is refreshed.
Implementing (22) requires only and its last transmitted value ; , and play no role in it. By construction, along the solutions,
The event generator as a gain. Combining (23) with (13) and (14), the input (21) satisfies
the factor being the price of the twofold appearance of noted above. Consequently, for any , as long as ,
Following [15, 16], the event generator together with the quadratic term is viewed as an operator from to with linear gain and offset on the ball of radius . Feeding into (20), which returns , closes the loop of Fig. 2. Section IV quantifies the gain of each block and shows that, when their product is small enough, the interconnection is stable.
Main Results
Throughout, we use the excitation level
which is the mean value over one period of ; equivalently, is the average damping coefficient of (20).
ISS of the Extremum Seeking Dynamics
We first treat in (20) as an arbitrary exogenous signal, disregarding how it is produced. In the framework of [15, 16], the resulting estimate is the property that the plant is assumed to possess; here it is derived rather than assumed. Item (a) below is an ISS-Lyapunov inequality for the discrete-time system obtained by sampling the Lyapunov function once per dither period, in the sense of [18].
Lemma 2 (ISS with respect to ): Let Assumption 1 hold and let the gain satisfy (17). Consider (20) driven by an arbitrary piecewise continuous input , and define
If
then, for all :
(a) (One-period ISS-Lyapunov inequality)
with ;
(b) (ISS estimate)
Moreover, the right-hand side of (30) involves only through its restriction to .
Proof: Step 1 (Removing the oscillatory forcing). Although never dies out, it integrates to zero over each period. Since , the variable in (26) satisfies
where we used . From Lemma 1(i) and (16),
Step 2 (Derivative of ). Along (31), for ,
with . Since touches zero twice per period, the first term cannot provide a pointwise decrease of ; the decrease emerges only after integration over a period, where Lemma 1(ii) can be exploited.
Step 3 (Decrease over one period). Let . By (4) and (28), . From (31) and Lemma 1(i), on , so Grönwall’s inequality [19] and give
For fixed , is a seminorm, hence . Integrating over , using , Lemma 1(ii), (35) and ,
Also, from (34), . Integrating (33) and using ,
By Young’s inequality with , and ,
and since (because ), inequality (29) follows.
Step 4 (ISS estimate). Fix and set , and . Whenever , the window constant obeys , and (29) becomes the linear recursion , whose coefficient lies in because . Iterating, for all with ,
where was used. Now take . By (34) on , (38), and ,
Here and, from , . Substituting , the coefficient of in (39) is at most , while the terms in add up to at most , by the definition of in (27) and . Finally, (32) gives and , which contributes and yields (30). Only the values of on were used. ■
Small-Gain Theorem
Theorem 1. Let Assumption 1 hold and consider the map (1) in feedback with the held gradient law (18), (17) and the event generator of Definition 1. Suppose that the parameters , and fulfill the small-gain condition
and the offset condition
with , , and in (27), (24) and (12). Let the dither frequency satisfy
Then, for every initial condition with , the solution exists for all , satisfies , and
where , , and
In addition, the inter-event times satisfy for all , with given in (51) below, so that Zeno behavior does not occur.
Proof. Let . Between events the control is constant, so is continuous and piecewise affine on and cannot escape in finite time. Part A shows that on and establishes the convergence estimates; Part B uses only the bound to prove that .
A. Stability analysis.
Step 1 (The ball is invariant). Since , and thus . By (42), and . If the claim were false, continuity of would provide a first time
at which . Up to that time the bound (24) is in force, giving on . Because (30) only sees on and is piecewise continuous, we may evaluate Lemma 2(b) at (continuing by zero beyond , for definiteness). With (40) and (41),
a contradiction. Thus (24) can be used freely on .
Step 2 (Closing the loop). From (24) and (32), . Then (31) gives with
By (42), , so Grönwall’s inequality yields on and the input of (29) obeys
Step 3 (Small gain). Inserting (46) into (29) and using the weighted Young inequality ,
The quantity is the loop gain of the interconnection in Figure 2 as seen by the Lyapunov function. Since by (40), this loop gain equals , and is exactly what is needed to retain a positive decrease rate. Therefore, with

Figure 2. Interconnection view of the closed loop. Stability holds under the small-gain condition .
we obtain , with .
Step 4 (Convergence). The recursion has the same form as in Step 4 of Lemma 2; running that argument again with instead of gives
where
was used. All three ingredients of are explicit: , and ; since , this is (45).
Step 5 (Bounds on and ). From , and (49), estimate (43) holds with .
Moreover, , and two applications of give (44) with .
Exclusion of Zeno behavior
We now use only the invariance established in Step 1. With one has and , whence
Writing , , , the sampling error (19) splits as , .
Since , and, because is constant between events, , we conclude that
At an event, by (22) and continuity of on , , while . Hence (50) gives
As does not depend on , either finitely many events occur or ; in both cases , the solution is defined for all and Steps 2–5 of Part A hold globally in time. ▪
Discussion
Remark 1 (Small-gain reading): In (40) two gains are multiplied: , which measures how strongly the ES dynamics amplify into (Lemma 2), and , which measures how strongly the event generator and the quadratic term send back into (see (24)). This is the one-dimensional, linear-gain version of the composition condition of [15], [16]. Two parameters feed : the relative tolerance , and the size of the region where the result is claimed, which enters because the quadratic part of the map is treated as an input. It is worth observing that drops out of , whereas a larger excitation level lowers it. Condition (40) is in the standard form , and the strict inequality is used only to keep the decrease rate positive; accordingly, the decay rate, the admissible initial error, the admissible radius in (45) all degrade as , the factor in (45) being the counterpart of the familiar of the classical small-gain estimate . Had the cross term in Step 3 of the proof been split with the symmetric inequality , the loop gain would have read and only could have been certified; the weighted splitting removes this artificial restriction at the cost of a larger constant multiplying .
Remark 2 (Design procedure): Dividing (40) by , the small-gain condition becomes , which suggests the following order of choices:
the gain and the amplitude , which fix , , and ;
a provisional threshold ;
a radius
which reserves an explicit share of the small-gain margin for the quadratic term, and the corresponding ;
the threshold and the offset , so that (41) holds;
the frequency in (42).
Since , and hence , grows with , lowering in step 4) preserves (40) and gives . Inequality (52) forces , i.e., the region in which convergence is certified is comparable to the probing amplitude. This is inherent to a statement proved on the exact, non-averaged loop. Being sufficient conditions obtained through worst-case bounds, (40)–(42) are conservative, and Section V shows satisfactory behavior for parameters well beyond them.
Remark 3 (Trade-offs): Three mechanisms determine the size of the final neighborhood in (43): the probing amplitude , which is unavoidable in ES; the oscillation , whose effect scales as ; and the event generator, which contributes a term proportional to . Without a strictly positive no uniform bound of the type (51) could hold, because keeps oscillating through zero even when ; what is obtained is practical stability in the presence of a non-vanishing matched disturbance, a situation also addressed in [20]. Since in (50) grows linearly with , one has : a faster dither shrinks the residual set but demands faster updates, in agreement with the intuition that the held control must track the probing oscillation.
Numerical Example
The scalar map (1) is simulated with
so that has a minimum and, by (17), a negative gain must be used. The probing signal (3) has amplitude and frequency rad/s, the adaptation gain is , and the integrator starts at , i.e., one unit away from the optimizer. The event generator of Definition 1 is run with and , and the triggering condition (22) is evaluated at every step of a fixed-step integration with step size s over a horizon of 200 s. For these values the excitation level is , so the mean time constant of (20) is s; moreover, and . The relative threshold lies well above the value allowed by Remark 2, so the example also serves to show how conservative the sufficient conditions are.
Figure 3 and Figure 4 show the input and the output of the map. Starting from , the input descends toward within roughly 25 s, a duration compatible with the time constant dictated by , and the output is brought from its initial excursions, which reach almost 4 because of the dither, to the vicinity of . After the transient, carries the

Figure 3. Input of the map and optimizer .

Figure 4. Output of the map and minimum value .
fast oscillation of amplitude imposed by the probing signal, which is the irreducible term in (43), superimposed on a slow, low-amplitude excursion about : the mean value of undershoots to about 0.75 near s, then drifts to about 1.2 near s and oscillates with decreasing amplitude afterwards. This slow component is the signature of the sample-and-hold implementation: between two events the integrator is driven by a constant which, owing to the persistent term in (8), is not exactly zero even when is small, so that moves linearly until the triggering rule detects the discrepancy and refreshes the control. The excursion stays within approximately 0.25 of , and the corresponding output remains below 1.3 for all s, in agreement with the practical-stability nature of Theorem 1, whose residual set is shaped not only by but also by the event-generator term in (45).
The control signal is displayed in Figure 5. As imposed by (18), it is piecewise constant, with only 13 distinct levels over the whole run. Its magnitude peaks at about 0.053 around s, when the estimation error and hence the useful component of (8) are largest, and then decays: after s the held values do not exceed 0.008 in absolute value. The distribution of the events, shown in Figure 6, follows the same pattern. Ten of the thirteen updates occur during the transient, within the first 45 s, while is still appreciable and the relative term in (22) is easily exceeded; the remaining three occur near , 155 and 190 s, separated by intervals of about one minute, during which the offset dominates the threshold and keeps the hold active even though keeps oscillating through zero. No accumulation of events is observed anywhere, and the shortest interval between consecutive events is of the order of one second, orders of magnitude larger than the guaranteed bound (51), which for (a ball that contains the whole trajectory, since ) gives , and ms.

Figure 5. Control signal delivered by the zero-order hold.

Figure 6. Instants of control update: fixed-step implementation (circles, 200 001 updates) and event-triggered implementation (stars, 13 updates).
Against the 200 001 updates of the time-triggered implementation, the event-triggered law converges to a neighborhood of the optimizer with 13 updates, a reduction above 99.99% in control transmissions. The price is the slow excursion of discussed above, which decreasing and , or increasing , would reduce at the expense of more updates (Remark 3).
Conclusions
We have analyzed an event-triggered implementation of gradient extremum seeking for scalar quadratic maps in which the triggering rule acts on the measured gradient estimate and includes a positive offset. The scalar structure of the demodulated signal, namely a nonnegative and persistently exciting adaptation coefficient plus an explicit zero-mean sinusoidal perturbation, allowed us to bypass averaging theory altogether: the ISS gain of the extremum seeking dynamics with respect to the sampling error was computed on the exact error equation, and closed-loop stability was obtained from a small-gain condition with the gain of the event generator, in which the quadratic term of the map is handled as part of the input. All design constants, the minimum dither frequency and the lower bound on the inter-event times are explicit. Dynamic triggers and Newton-based schemes are natural next steps.
References
- [1]K. B. Ariyur and M. Krstić, Real-Time Optimization by Extremum-Seeking Control. NJ, USA: Wiley, 2003.
- [2]M. Krstić and H.-H. Wang, “Stability of extremum seeking feedback for general nonlinear dynamic systems,” Automatica, vol. 36, pp. 595–601, 2000.DOI
- [3]M. Krstić, “Extremum seeking control,” in Encyclopedia of Systems and Control (J. Baillieul and T. Samad, eds.), pp. 413–416, London: Springer, 2014.
- [4]A. Ghaffari, M. Krstić, and D. Nešić, “Multivariable Newton-based extremum seeking,” Automatica, vol. 48, no. 8, pp. 1759–1767, 2012.
- [5]T. R. Oliveira, M. Krstić, and D. Tsakibano, “Extremum seeking for static maps with delays,” IEEE Transactions on Automatic Control, vol. 62, no. 4, pp. 1911–1926, 2017.DOI
- [6]T. R. Oliveira and M. Krstić, Extremum Seeking through Delays and PDEs. Society for Industrial and Applied Mathematics, 2022.DOI
- [7]C. Zhang, D. Arnold, N. Ghods, A. Siranosian, and M. Krstić, “Source seeking with non-holonomic unicycle without position measurement and with tuning of forward velocity,” Systems & Control Letters, vol. 56, no. 3, pp. 245–252, 2007.DOI
- [8]P. Tabuada, “Event-triggered real-time scheduling of stabilizing control tasks,” IEEE Transactions on Automatic Control, vol. 52, no. 9, pp. 1680–1685, 2007.DOI
- [9]W. P. M. H. Heemels, K. H. Johansson, and P. Tabuada, “An introduction to event-triggered and self-triggered control,” in 51st IEEE Conference on Decision and Control (CDC), pp. 3270–3285, 2012.DOI
- [10]P. Zhang, T. Liu, and Z.-P. Jiang, “Input-to-state stabilization of nonlinear discrete-time systems with event-triggered controllers,” Systems & Control Letters, vol. 103, pp. 16–22, 2017.DOI
- [11]V. H. P. Rodrigues, T. R. Oliveira, L. Hsu, M. Diagne, and M. Krstić, “Event-triggered and periodic event-triggered extremum seeking control,” Automatica, vol. 174, p. 112161, 2025.
- [12]V. H. P. Rodrigues, T. R. Oliveira, M. Krstić, and P. Tabuada, “Event-triggered Newton extremum seeking for multivariable optimization,” arXiv preprint arXiv:2601.14416, 2026.
- [13]V. H. P. Rodrigues, T. R. Oliveira, M. Krstić, and F. Allgöwer, “Event-triggered discrete-time multivariable extremum seeking systems,” arXiv preprint arXiv:2607.25223, 2026.
- [14]V. H. P. Rodrigues, T. R. Oliveira, M. Krstić, and T. Başar, “Distributed event-triggered Nash equilibrium seeking,” Automatica, vol. 192, p. 113164, 2026.
- [15]T. Liu and Z.-P. Jiang, “A small-gain approach to robust event-triggered control of nonlinear systems,” IEEE Transactions on Automatic Control, vol. 60, no. 8, pp. 2072–2085, 2015.
- [16]T. Liu, P. Zhang, and Z.-P. Jiang, Robust Event-Triggered Control of Nonlinear Systems. Singapore: Springer, 2020.DOI
- [17]P. Pepe and Z.-P. Jiang, “A Lyapunov–Krasovskii methodology for ISS and iISS of time-delay systems,” Systems & Control Letters, vol. 55, no. 12, pp. 1006–1014, 2006.DOI
- [18]Z.-P. Jiang and Y. Wang, “A converse Lyapunov theorem for discrete-time systems with disturbances,” Systems & Control Letters, vol. 45, no. 1, pp. 49–58, 2002.DOI
- [19]H. K. Khalil, Nonlinear Systems. Upper Saddle River, New Jersey: Prentice Hall, 3rd ed., 2002.
- [20]I. Karafyllis and M. Krstić, “Deadzone-adapted disturbance suppression control for global practical IOS and zero asymptotic gain to matched uncertainties,” Systems & Control Letters, vol. 185, p. 105746, 2024.
