You are currently viewing a new version of our website. To view the old version click .
Mathematics
  • Article
  • Open Access

2 December 2025

Composite Lyapunov Criteria for Stability and Convergence with Applications to Optimization Dynamics

Department of Mathematics and Natural Sciences & Center of Applied Mathematics and Bioinformatics (CAMB), Gulf University for Science and Technology, P.O. Box 7207, Hawally 32093, Kuwait
This article belongs to the Special Issue Advances in Nonlinear Analysis and Applications

Abstract

We propose a composite Lyapunov framework for nonlinear autonomous systems that ensures strict decay through a pair of differential inequalities. The approach yields integral estimates, quantitative convergence rates, vanishing of dissipation measures, convergence to a critical set, and semistability under mild conditions, without relying on invariance principles or compactness assumptions. The framework unifies convergence to points and sets and is illustrated through applications to inertial gradient systems and Primal–Dual gradient flows.

1. Introduction and Problem Setting

The analysis of asymptotic behavior in nonlinear dynamical systems remains a central theme in control theory and applied mathematics. Classical methods, such as Lyapunov’s direct approach, LaSalle’s invariance principle, and Matrosov-type criteria, form the foundation of stability analysis for many systems, including mechanical, optimization, and distributed models. Despite their effectiveness, these tools have structural limitations. LaSalle’s invariance principle identifies invariant sets but does not, by itself, guarantee convergence to them, while Matrosov-type conditions often provide only weak asymptotic results, usually expressed through the vanishing of dissipation measures in the limit inferior sense. Strong convergence typically requires additional compactness or stability assumptions on the invariant set.
The proposed approach is inspired by the classical development of asymptotic stability theory—from LaSalle’s invariance principle and Matrosov’s auxiliary–function method to later reinterpretations, such as the LaSalle-type formulation in [1]. In contrast to these methods, it employs a single composite Lyapunov function that achieves strict decay directly, without the use of nested or auxiliary functions. LaSalle’s invariance principle (see, e.g., [2]) provides a basic result: when a Lyapunov function is nonincreasing along trajectories, convergence is guaranteed only to the largest invariant set where its derivative vanishes. This result is qualitative and often depends on compactness.
To address these limitations, Matrosov [3] introduced an auxiliary function whose derivative remains strictly negative on the set where the derivative of the Lyapunov function vanishes, thereby establishing asymptotic stability without assuming compactness. This idea was later developed by Loria, Mazenc, and Teel [4], who proposed a nested Matrosov theorem to handle multiple auxiliary functions and nonautonomous systems, ensuring uniform convergence under persistency-of-excitation conditions. Further extensions were given by Mazenc and Nešić [5] for time-varying systems and by Teel et al. [6] for differential inclusions, where tailored Matrosov functions were used to prove attractivity of compact sets under arbitrary switching among finitely many vector fields. In the classical ODE setting, Astolfi and Praly [1] formulated a LaSalle-type version of Matrosov’s theorem, extending the analysis to systems with multiple equilibria and linking Matrosov’s reasoning with the invariance principle through a family of auxiliary functions and weak decay conditions.
This work develops a constructive alternative that derives strict decay directly from a pair of differential inequalities. Consider the autonomous system
x ˙ ( t ) = f ( x ( t ) ) , x ( 0 ) = x 0 R n ,
where f : R n R n is locally Lipschitz. Under this assumption, the system admits a unique solution x ( · ) on a maximal interval of existence. When needed, we assume the system is forward complete so that every trajectory is defined for all t 0 . The equilibrium set is
E f : = { x R n : f ( x ) = 0 } .
A point x E f is Lyapunov stable if, for every neighborhood U of x , there exists a smaller neighborhood V U such that all trajectories starting in V remain in U for all future times. If, in addition, x ( t ) x as t , the equilibrium is asymptotically stable.
In this paper, the analysis extends beyond isolated equilibria to the stability of sets associated with system (1), with particular attention to pointwise asymptotic stability of a set (PAS). Pointwise asymptotic stability means that each point of the set is Lyapunov stable and that every trajectory starting near the set converges to some limit within it.
To clarify this notion, note that in the literature, PAS is typically defined with respect to the equilibrium set (see, e.g., [7,8]), while several works use the term semistability to describe the same property when restricted to equilibria (see, e.g., [9,10]). In this paper, the term PAS is used for an arbitrary set, whereas the term semistability is reserved for the case where the set coincides with the equilibrium set. An equilibrium is, therefore, semistable if it is Lyapunov stable and every trajectory starting near it converges to a (possibly different) Lyapunov stable equilibrium. When the equilibrium set reduces to a single point, semistability and asymptotic stability coincide.
The concepts of pointwise asymptotic stability and semistability provide a natural framework for systems with nonisolated equilibria and have been studied in various settings, including differential equations, differential inclusions, and hybrid systems (see, for instance, [7,8,9,10,11,12,13]). These works form the conceptual background for the results developed in this paper.
Having established the relevant stability notions, we now introduce the analytical framework used to verify them. The proposed approach constructs a composite Lyapunov function from two differential inequalities that capture the system’s dissipative behavior. Specifically, let V 1 , V 2 : R n R be continuously differentiable functions and N 1 , N 2 : R n [ 0 , ) be continuous, nonnegative functions. The functions V 1 and V 2 act as Lyapunov candidates, while N 1 and N 2 measure the dissipation reflected in their derivatives. Along the trajectories of (1), they satisfy
V ˙ 1 ( x ) N 1 ( x ) , V ˙ 2 ( x ) N 2 ( x ) + h ( N 1 ( x ) ) ,
where h : [ 0 , ) [ 0 , ) is continuous with h ( 0 ) = 0 .
The quantities N 1 and N 2 are called observables because they measure the rate of dissipation in the system and indicate how far the trajectory is from its asymptotic regime. They can be interpreted as measurable indicators of decay: each N i ( x ) is a nonnegative quantity that vanishes precisely when the corresponding Lyapunov function V i stops decreasing. In this sense, N i “observes” the energy dissipation at state x. Their role is twofold. Analytically, they quantify the dissipation appearing in the inequalities that govern the time derivatives of V 1 and V 2 , providing a direct link to integral estimates and asymptotic convergence. Geometrically, their simultaneous vanishing defines the long-term behavior of the system. The set
E : = { x R n : N 1 ( x ) = 0 , N 2 ( x ) = 0 }
thus characterizes the asymptotic regime approached by trajectories and offers an observable-based representation of equilibria. This viewpoint is especially useful in nonsmooth or distributed settings where the vector field f may not be explicitly available, but the dissipation measures N 1 and N 2 remain well-defined.
Since N 1 and N 2 encode complementary information about system dissipation, it is natural to combine them through a single Lyapunov expression that reflects their joint effect. The first function, V 1 , monitors the main dissipation quantified by N 1 , while V 2 remains sensitive when V ˙ 1 vanishes. By coupling them through the gain h ( N 1 ) , the composite function W = V 1 + δ V 2 achieves strict decay for a suitable δ > 0 , providing a unified Lyapunov framework that ensures convergence to the set E.
A small-gain condition on h ensures that the influence of N 1 on the decay of V 2 does not cancel the overall dissipation. To capture their combined effect, we introduce the composite Lyapunov function
W ( x ) = V 1 ( x ) + δ V 2 ( x ) , δ > 0 ,
and show that, for a suitable δ , there exists γ > 0 such that
W ˙ ( x ) γ N 1 ( x ) + N 2 ( x ) .
This strict-decay inequality combines the information from both differential inequalities, enforcing the vanishing of N 1 ( x ( t ) ) and N 2 ( x ( t ) ) along every trajectory. It forms the cornerstone of the analysis developed in this paper and shows that the proposed approach achieves a direct decay relation, without relying on hierarchical auxiliary–function constructions or successive negativity checks.
Every bounded trajectory satisfies dist ( x ( t ) , E ) 0 as t , meaning that trajectories asymptotically approach the critical set where both dissipation measures vanish. Since equilibria make N 1 and N 2 equal to zero, the equilibrium set E f is contained in E. In many cases, the two sets coincide; therefore, trajectories approach the equilibrium set, leading to semistability when each equilibrium is Lyapunov stable. More generally, if every point of E is Lyapunov stable, then E is pointwise asymptotically stable (PAS). The strict-decay inequality further provides integral estimates and convergence of observables, which form the basis for these stability results. Finally, when E reduces to a single equilibrium, global asymptotic stability follows.
This composite Lyapunov construction unifies and extends the classical Lyapunov and Matrosov approaches. It establishes convergence and stability properties without relying on compactness or invariance principles and applies naturally to nonlinear and optimization-driven systems. In particular, it encompasses the dynamics of inertial gradient-like systems and Primal–Dual gradient flows that arise in constrained optimization and networked control problems. These two classes of systems serve as detailed case studies in the sequel, illustrating how the general results of the paper guarantee convergence and stability of their equilibrium sets. Beyond optimization, the same framework can also model dynamic adjustment processes in economics, such as signaling-based Cournot competition [14], where the evolution of agents’ strategies toward equilibrium can be analyzed through stability and convergence properties.
In addition to qualitative convergence, the approach provides quantitative estimates for the rate at which trajectories approach the critical set, linking decay inequalities with integral estimates and error–bound conditions. These results make it possible to assess how rapidly the system stabilizes, offering explicit performance guarantees that connect Lyapunov decay with convergence speed—an aspect of practical relevance in optimization, control, and economic dynamics.

2. Main Results

The following results establish the complete framework built on the pair of differential inequalities introduced earlier. The first step (Section 2.1) proves that a suitable combination of V 1 and V 2 yields a composite Lyapunov function that decreases strictly along trajectories. Subsequent subsections derive their main consequences—integral bounds, convergence to the critical set, quantitative decay rates, and stability properties. Together, they provide a unified and constructive approach to analyzing asymptotic behavior without relying on invariance principles or compactness assumptions.

2.1. Strict Decay of the Composite Function

In the classical Matrosov-type theorem, the auxiliary Lyapunov functions V i are assumed to be continuously differentiable, and their derivatives V ˙ i must satisfy a uniform continuity condition along trajectories to ensure strict decay via integral arguments. In contrast, the present framework removes these smoothness and global regularity assumptions. The quantities N i are only required to be nonnegative, locally bounded, and continuous (without requiring uniform continuity), which is sufficient to establish the strict-decay inequality for the composite function W = V 1 + δ V 2 . This highlights the analytical simplicity and wider applicability of the proposed criterion while retaining the core coupling idea behind Matrosov’s construction.
We begin with the fundamental decay result that underlies the entire framework.
Theorem 1
(Strict Decay of a Composite Lyapunov Function). Suppose there exist continuously differentiable functions V 1 , V 2 : R n R , continuous nonnegative functions N 1 , N 2 : R n [ 0 , + ) , and a continuous function h : [ 0 , + ) [ 0 , + ) with h ( 0 ) = 0 such that, along every solution,
V ˙ 1 ( x ) N 1 ( x ) , V ˙ 2 ( x ) N 2 ( x ) + h ( N 1 ( x ) ) .
Assume in addition that
L : = sup r > 0 h ( r ) r < + .
Then, for any δ ( 0 , 1 / L ) and W ( x ) : = V 1 ( x ) + δ V 2 ( x ) , there exists a constant
γ : = min { 1 δ L , δ } > 0
such that, along all solutions,
W ˙ ( x ) γ N 1 ( x ) + N 2 ( x ) .
Proof. 
Take any solution x ( · ) of the system. By assumption, the functions V 1 and V 2 satisfy
V ˙ 1 ( x ) N 1 ( x ) , V ˙ 2 ( x ) N 2 ( x ) + h ( N 1 ( x ) ) .
Fix a parameter δ > 0 and define the composite Lyapunov function
W ( x ) : = V 1 ( x ) + δ V 2 ( x ) .
Differentiating along the trajectory gives
W ˙ ( x ) = V ˙ 1 ( x ) + δ V ˙ 2 ( x ) N 1 ( x ) δ N 2 ( x ) + δ h ( N 1 ( x ) ) .
Now apply the global slope bound. By definition of
L : = sup r > 0 h ( r ) r ,
we have h ( s ) L s for every s 0 . In particular, for s = N 1 ( x ) ,
δ h ( N 1 ( x ) ) δ L N 1 ( x ) .
Substituting this into the inequality for W ˙ yields
W ˙ ( x ) ( 1 δ L ) N 1 ( x ) δ N 2 ( x ) .
Choose any δ ( 0 , 1 / L ) . Then both coefficients 1 δ L and δ are positive. Since N 1 ( x ) , N 2 ( x ) 0 , we can estimate the right-hand side by pulling out the smaller of the two coefficients:
( 1 δ L ) N 1 ( x ) + δ N 2 ( x ) min { 1 δ L , δ } N 1 ( x ) + N 2 ( x ) .
Therefore,
W ˙ ( x ) γ N 1 ( x ) + N 2 ( x ) , γ : = min { 1 δ L , δ } > 0 .
This proves that the composite Lyapunov function decreases strictly along every solution, with a decay rate controlled by γ . □
The constants in the strict-decay inequality can, in fact, be optimized, leading to the following refinement.
Remark 1
(Role of h and analytical form of constants). The function h : [ 0 , ) [ 0 , ) represents the coupling gain that links the decay channels N 1 and N 2 . It measures how the dissipation detected by N 1 influences the derivative of V 2 through the inequality V ˙ 2 N 2 + h ( N 1 ) . The continuity of h with h ( 0 ) = 0 ensures compatibility of the two inequalities, while the bounded-slope condition h ( r ) L r (i.e., h ( r ) / r < for r > 0 ) is a small-gain assumption guaranteeing that the feedback of N 1 into V ˙ 2 cannot dominate the total decay. Under this bound, we obtain the explicit computation
W ˙ = V ˙ 1 + δ V ˙ 2 ( 1 δ L ) N 1 δ N 2 ,
which yields a strict-decay inequality W ˙ γ ( N 1 + N 2 ) for any δ ( 0 , 1 / L ) with γ = min { 1 δ L , δ } > 0 . Hence, the constants ( δ , γ ) can be chosen uniformly in compact form, providing a clear analytical interpretation of the parameters that appear in Theorem 1. In the next remark, the optimal choice of ( δ , γ ) is characterized analytically. All constants can be written in compact analytical form through the single parameter pair ( L , δ ) , yielding γ = min { 1 δ L , δ } .
Remark 2
(Optimal choice of constants). The decay estimate in Theorem 1 holds for any δ ( 0 , 1 / L ) with
W ˙ ( x ) γ N 1 ( x ) + N 2 ( x ) , γ = min { 1 δ L , δ } .
The guaranteed rate γ depends on the tuning parameter δ. Since 1 δ L decreases linearly with δ while δ increases linearly, the quantity γ is maximized when the two terms coincide, i.e.,
1 δ L = δ .
Solving for δ gives the optimal choice
δ = 1 1 + L .
Substituting this value into the expression for γ yields
γ = 1 1 + L .
Thus, the sharpest form of the strict-decay inequality is
W ˙ ( x ) 1 1 + L N 1 ( x ) + N 2 ( x ) .

2.2. Local Strict Decay Under Bounded Trajectories

The global result in Theorem 1 relies on the uniform slope bound L = sup r > 0 h ( r ) / r < , which guarantees a global decay rate valid for all trajectories. When such a bound is available only on a bounded region or along a specific trajectory, a local version can be established with trajectory-dependent constants. The constant L in Theorem 1 controls the interaction term h ( N 1 ) globally. In many systems, however, h ( r ) / r may be bounded only on the range of N 1 actually visited by the trajectory. To capture this situation, we restrict attention to a positively invariant set  Ω R n that contains the entire trajectory { x ( t ) : t 0 } . On such a set, the ratio h ( s ) / s remains finite, allowing a local version of the strict-decay inequality with constants that depend on Ω and ultimately on the initial condition.
Theorem 2
(Local Strict Decay with Optimal Constants). Suppose there exist V 1 , V 2 C 1 ( R n ) , continuous functions N 1 , N 2 : R n [ 0 , ) , and a continuous function h : [ 0 , ) [ 0 , ) with h ( 0 ) = 0 such that, along every trajectory,
V ˙ 1 ( x ) N 1 ( x ) , V ˙ 2 ( x ) N 2 ( x ) + h N 1 ( x ) .
Let Ω R n be any positively invariant set containing the trajectory { x ( t ) : t 0 } (for instance, Ω = R n for a global statement). Define
S Ω : = { N 1 ( x ) : x Ω } , B Ω : = sup s S Ω { 0 } h ( s ) s [ 0 , ] .
If B Ω < , then for any δ ( 0 , 1 / B Ω ) the composite function W : = V 1 + δ V 2 satisfies, along the trajectory,
W ˙ ( x ) γ N 1 ( x ) + N 2 ( x ) , γ : = min { 1 δ B Ω , δ } > 0 .
Moreover, the decay rate is optimized by choosing
δ = 1 1 + B Ω , γ = 1 1 + B Ω ,
which yields the explicit bound
W ˙ ( x ) 1 1 + B Ω N 1 ( x ) + N 2 ( x ) a l o n g   t h e   t r a j e c t o r y .
Sketch of Proof.
The argument follows exactly as in Theorem 1: starting from W ˙ = V ˙ 1 + δ V ˙ 2 N 1 δ N 2 + δ h ( N 1 ) and using the local bound h ( s ) B Ω s for s S Ω gives
W ˙ ( 1 δ B Ω ) N 1 δ N 2 .
Choosing δ ( 0 , 1 / B Ω ) yields W ˙ γ ( N 1 + N 2 ) with γ = min { 1 δ B Ω , δ } > 0 , and optimizing over δ produces δ = γ = 1 / ( 1 + B Ω ) . □
Corollary 1
(Bounded-Trajectory Version with L R ). If, along a trajectory x ( · ) , one has N 1 ( x ( t ) ) R for some R > 0 , define
L R : = sup 0 s R h ( s ) s < .
Then, for any δ ( 0 , 1 / L R ) , the composite function W = V 1 + δ V 2 satisfies
W ˙ ( x ) γ ( N 1 ( x ) + N 2 ( x ) ) , γ = min { 1 δ L R , δ } > 0 ,
along that trajectory. The optimal choice is
δ = 1 1 + L R , γ = 1 1 + L R .
Remark 3
(Useful Specializations).
  • Global version: If L : = sup r > 0 h ( r ) / r < , take Ω = R n , so that B Ω = L .
  • Bounded-trajectory version: If the solution is bounded in a positively invariant K, set Ω = K ; then B Ω = sup 0 s R K h ( s ) / s with R K : = sup x K N 1 ( x ) .

2.3. Integral Estimates and Vanishing of Observables

The next result translates the strict-decay inequality into quantitative information along trajectories. It shows that the total dissipation of the observables is finite and that, under a mild continuity assumption, both observables vanish asymptotically. This step connects the decay property of W to the convergence behavior of the system.
Proposition 1
(Integral estimates and convergence of observables). Under the assumptions of Theorem 1, the composite function W ( x ( t ) ) is nonincreasing along solutions and, therefore, converges to a finite limit as t . Moreover,
0 N 1 ( x ( t ) ) + N 2 ( x ( t ) ) d t < .
If, in addition, the functions t N i ( x ( t ) ) are uniformly continuous on [ 0 , ) , then the finiteness of the above integral implies
lim t N 1 ( x ( t ) ) = 0 , lim t N 2 ( x ( t ) ) = 0 .
Proof. 
By Theorem 1 there exists γ > 0 such that, along every solution x ( · ) ,
W ˙ ( x ( t ) ) γ N 1 ( x ( t ) ) + N 2 ( x ( t ) ) for all t 0 .
Since the right–hand side is nonpositive, the map t W ( x ( t ) ) is nonincreasing. In particular, for all T 0 ,
W ( x ( T ) ) W ( x ( 0 ) ) .
Integrating (2) on [ 0 , T ] gives
W ( x ( T ) ) W ( x ( 0 ) ) γ 0 T N 1 ( x ( t ) ) + N 2 ( x ( t ) ) d t ,
hence,
0 T N 1 ( x ( t ) ) + N 2 ( x ( t ) ) d t W ( x ( 0 ) ) W ( x ( T ) ) γ .
Because W is nonincreasing along the trajectory, the limit lim T W ( x ( T ) ) exists in [ , + ) . In Lyapunov constructions, one typically chooses V 1 , V 2 0 , in which case W 0 and the limit is finite. Under this mild bounded–below condition, passing to the limit T in (3) yields
0 N 1 ( x ( t ) ) + N 2 ( x ( t ) ) d t W ( x ( 0 ) ) lim T W ( x ( T ) ) γ < .
We now prove the asymptotic vanishing of each observable under the uniform continuity assumption. Fix i { 1 , 2 } and define g ( t ) : = N i ( x ( t ) ) . Then g : [ 0 , ) [ 0 , ) is uniformly continuous by hypothesis, and 0 g ( t ) d t < by the previous estimate. We claim that lim t g ( t ) = 0 . Suppose, for contradiction, that this limit does not exist or is not zero. Then there exists ε > 0 and a sequence of times t k such that g ( t k ) ε for all k. By uniform continuity of g, there exists δ ( 0 , 1 ) such that
| t s | < δ | g ( t ) g ( s ) | < ε / 2 .
In particular, g ( t ) ε / 2 for all t [ t k δ / 2 , t k + δ / 2 ] . By taking a subsequence (still denoted t k ) with pairwise distance at least δ , these intervals are disjoint. Therefore,
0 g ( t ) d t k = 1 t k δ / 2 t k + δ / 2 g ( t ) d t k = 1 ε 2 δ = + ,
which contradicts 0 g ( t ) d t < . Hence, lim t g ( t ) = 0 . Since i { 1 , 2 } was arbitrary, we conclude
lim t N 1 ( x ( t ) ) = lim t N 2 ( x ( t ) ) = 0 .
Finally, combining the nonincreasing property of W with its bounded–below property along the trajectory (e.g., V 1 , V 2 0 ) shows that W ( x ( t ) ) converges to a finite limit as t . This completes the proof. □
Remark 4.
Classical Matrosov-type theorems, including the formulation proposed in [1], typically establish only the weaker conclusion
lim inf t N i ( x ( t ) ) = 0 ,
which guarantees that the observables vanish along subsequences but does not ensure the convergence. In contrast, the strict-decay framework developed here, together with the mild uniform continuity assumption along trajectories, yields the full limits
lim t N 1 ( x ( t ) ) = lim t N 2 ( x ( t ) ) = 0 .
This provides a strictly stronger asymptotic conclusion than those available in the classical Matrosov setting.
Bounded trajectories and local Lipschitz continuity of the dynamics f and the observables N i imply that t N i ( x ( t ) ) is uniformly continuous on [ 0 , ) . Hence, by Proposition 1, N i ( x ( t ) ) 0 as t .

2.4. Convergence to the Critical Set

The vanishing of the observables characterizes the asymptotic behavior of trajectories in terms of the critical set
E : = { x R n : N 1 ( x ) = 0 , N 2 ( x ) = 0 } .
Notice that the critical set E may, in general, strictly contain the equilibrium set E f : = { x : f ( x ) = 0 } . This happens when the observables N i capture only partial dissipation effects that can vanish without forcing f ( x ) = 0 . In such cases, trajectories approach the largest invariant subset of E, and convergence to equilibria in E f requires additional structural or invariance conditions on the dynamics.
The following result shows that the vanishing of the observables forces every bounded trajectory to approach this set asymptotically.
Theorem 3
(Convergence to E). Suppose that, along a trajectory x ( · ) , the functions t N i ( x ( t ) ) are uniformly continuous on [ 0 , ) for i = 1 , 2 . Then
dist ( x ( t ) , E ) 0 a s t .
Proof. 
Let M ( x ) : = N 1 ( x ) + N 2 ( x ) , so that E = { x : M ( x ) = 0 } . By Proposition 1 and the uniform continuity of t N i ( x ( t ) ) on [ 0 , ) , we have
M ( x ( t ) ) 0 as t .
Fix ε > 0 and consider the closed set
F ε : = { x R n : dist ( x , E ) ε } .
On F ε the function M cannot vanish, since points of F ε are at least ε away from E. By the continuity of M, this implies that on every compact subset of F ε , the function M admits a strictly positive minimum. Since the trajectory is bounded, its image { x ( t ) : t 0 } ¯ is compact; hence, this compactness condition is automatically satisfied for the portion of the trajectory lying in F ε . In particular, along the bounded portion of the trajectory that may lie in F ε , there exists η ( ε ) > 0 such that
dist ( x ( t ) , E ) ε M ( x ( t ) ) η ( ε ) .
Suppose, toward a contradiction, that there exists a sequence t k with dist ( x ( t k ) , E ) ε for all k. Then by the implication above,
M ( x ( t k ) ) η ( ε ) for all k .
But this contradicts the fact that M ( x ( t ) ) 0 as t .
Therefore, such a sequence cannot exist, and we conclude
dist ( x ( t ) , E ) 0 as t ,
which proves the claim. □
The convergence stated in Theorem 3 applies not only to isolated equilibria but also when the critical set E forms a continuum, such as a curve or manifold of equilibria. In this case, the result ensures an asymptotic approach to the set E in the sense of semistability, rather than convergence to a single equilibrium point.
Remark 5
(Separation property). The argument uses that M ( x ) > 0 whenever dist ( x , E ) ε . This separation property—a standard local error–bound condition for the zero set of a nonnegative continuous function—holds automatically on compact subsets or whenever M has no flat valleys away from E. It ensures that the implication M ( x ( t ) ) 0 dist ( x ( t ) , E ) 0 is mathematically sound without assuming global boundedness.
Building on Theorem 3, which ensures convergence of trajectories to the critical set E, we obtain the following consequence.

2.5. Quantitative Convergence Rate

This subsection strengthens the qualitative convergence result by giving explicit rates under two simple hypotheses: strict decay of W and a local error bound linking the observables to the distance from E. Integrating the decay yields an L 2 ( 0 , ) estimate for the distance. An averaging step on each window [ T , 2 T ] then produces times τ [ T , 2 T ] with dist ( x ( τ ) , E ) = O ( T 1 / 2 ) . If the distance is eventually nonincreasing, the same idea on the backward window [ t / 2 , t ] gives a pointwise rate dist ( x ( t ) , E ) = O ( t 1 / 2 ) for large t. A closing remark records that a local quadratic growth of W near E upgrades these sublinear bounds to exponential decay, with constants explicit in terms of the decay modulus γ and the error–bound parameters.
Proposition 2
(Quantitative convergence from a local error bound). Assume that along a trajectory x ( · ) , the strict-decay inequality holds:
W ˙ ( t ) γ [ N 1 ( x ( t ) ) + N 2 ( x ( t ) ) ] , γ > 0 .
Suppose there exists a neighborhood U of E and constants c 1 , c 2 > 0 such that
N i ( x ) c i dist ( x , E ) 2 f o r a l l x U , i = 1 , 2 .
Set c : = c 1 + c 2 . Then:
(1)
L 2 –integrability.  Once the trajectory enters U,
0 + dist ( x ( t ) , E ) 2 d t W ( x ( 0 ) ) lim t W ( x ( t ) ) γ c < + .
(2)
Subsequence rate.  Define
K : = W ( x ( 0 ) ) lim t W ( x ( t ) ) γ c .
Then for every T > 0 ,
T 2 T dist ( x ( t ) , E ) 2 d t K 2 ,
hence, by averaging on [ T , 2 T ] , there exists τ [ T , 2 T ] with
dist ( x ( τ ) , E ) 2 1 T T 2 T dist ( x ( t ) , E ) 2 d t K 2 T ,
so dist ( x ( τ ) , E ) K T .
(3)
Pointwise rate.  If, in addition, t dist ( x ( t ) , E ) is uniformly continuous on [ 0 , + ) and eventually nonincreasing, then there exist T 0 > 0 and C > 0 such that
dist ( x ( t ) , E ) C t , t T 0 .
Proof. 
Let x ( · ) be a trajectory for which the strict-decay estimate
W ˙ ( t ) γ [ N 1 ( x ( t ) ) + N 2 ( x ( t ) ) ] , γ > 0 ,
holds. Assume there exist a neighborhood U of E and c 1 , c 2 > 0 such that
N i ( x ) c i dist ( x , E ) 2 for all x U , i = 1 , 2 ,
and set c : = c 1 + c 2 .
Fix any time T U 0 such that x ( t ) U for all t T U (for example, any T U after which the trajectory remains in U). All estimates below are written on [ T U , ) .
(1) 
L 2 –integrability. On U, summing (5) gives
N 1 ( x ( t ) ) + N 2 ( x ( t ) ) c dist ( x ( t ) , E ) 2 ( t T U ) .
Combining with (4) yields
W ˙ ( t ) γ c dist ( x ( t ) , E ) 2 ( t T U ) .
Integrate (6) on [ T U , T ] :
γ c T U T dist ( x ( t ) , E ) 2 d t W ( x ( T U ) ) W ( x ( T ) ) .
Let T ; since W ( x ( t ) ) is nonincreasing and W 0 , lim t W ( x ( t ) ) exists and is finite. Hence,
T U dist ( x ( t ) , E ) 2 d t W ( x ( T U ) ) lim t W ( x ( t ) ) γ c W ( x ( 0 ) ) lim t W ( x ( t ) ) γ c < .
Since the integrand is nonnegative, extending the lower limit to 0 preserves finiteness, proving (1).
(2) 
Subsequence  O ( T 1 / 2 )  rate. For any T T U , integrate (6) on [ T , 2 T ] :
γ c T 2 T dist ( x ( t ) , E ) 2 d t W ( x ( T ) ) W ( x ( 2 T ) ) W ( x ( 0 ) ) W ,
where W : = lim t W ( x ( t ) ) exists since W 0 and is nonincreasing. Define
K : = W ( x ( 0 ) ) W γ c , so T 2 T dist ( x ( t ) , E ) 2 d t K 2 .
Because | [ T , 2 T ] | = T , the average of dist ( x ( t ) , E ) 2 on [ T , 2 T ] satisfies
1 T T 2 T dist ( x ( t ) , E ) 2 d t K 2 T .
If dist ( x ( t ) , E ) 2 were strictly larger than this average for every t [ T , 2 T ] , integrating would give
T 2 T dist ( x ( t ) , E ) 2 d t > T · 1 T T 2 T dist ( x ( s ) , E ) 2 d s = K 2 ,
a contradiction. Hence, there exists τ [ T , 2 T ] such that
dist ( x ( τ ) , E ) 2 1 T T 2 T dist ( x ( t ) , E ) 2 d t K 2 T ,
and therefore dist ( x ( τ ) , E ) K T .
(3) 
Pointwise  O ( t 1 / 2 )  under eventual monotonicity. Assume there exists t 1 0 such that dist ( x ( t ) , E ) is nonincreasing on [ t 1 , ) . For any t max { 2 T U , 2 t 1 } , integrating (6) on [ t / 2 , t ] gives
t / 2 t dist ( x ( s ) , E ) 2 d s K 2 .
Since | [ t / 2 , t ] | = t / 2 , there exists τ [ t / 2 , t ] with
dist ( x ( τ ) , E ) 2 2 K 2 t dist ( x ( τ ) , E ) 2 K t .
By monotonicity and τ t ,
dist ( x ( t ) , E ) dist ( x ( τ ) , E ) 2 K t .
Thus, the claim holds with T 0 : = max { 2 T U , 2 t 1 } and C : = 2 K .
The three claims complete the proof. □
Remark 6
(Analytical meaning of the condition (5)). The inequality (5) expresses a local error–bound or quadratic growth property that connects the observables N i to the distance from the equilibrium set E. It guarantees that, in a neighborhood of E, the dissipation terms N i ( x ) are sufficiently strong to dominate the local behavior of the trajectories, so that the strict decay of W translates into a quantitative decrease of dist ( x ( t ) , E ) . In this sense, (5) provides a clear analytical link between the decay of the Lyapunov function and the convergence rate. The condition formalizes the idea that N i ( x ) quantify the proximity to equilibrium with quadratic accuracy, which is essential for obtaining the explicit O ( t 1 / 2 ) and exponential convergence rates stated in Proposition 2.
Remark 7.
If in Proposition 2, we only assume uniform continuity of t dist ( x ( t ) , E ) , then for every large T there exist τ [ T , 2 T ] and a fixed Δ > 0 (independent of T) such that dist ( x ( s ) , E ) K / T + ε for all s [ τ , τ + Δ ] . This yields recurring short-interval bounds but not a global pointwise O ( t 1 / 2 ) rate.
Remark 8
(Quadratic growth ⇒ exponential rate). Assume there exist m > 0 and r > 0 such that
W ( x ) W m dist ( x , E ) 2 w h e n e v e r dist ( x , E ) r .
Pick t 0 0 large enough so that dist ( x ( t ) , E ) r for all t t 0 (which holds since dist ( x ( t ) , E ) 0 ). Then, for all t t 0 ,
W ˙ ( t ) γ [ N 1 ( x ( t ) ) + N 2 ( x ( t ) ) ] γ c m [ W ( x ( t ) ) W ] .
By Grönwall inequality on [ t 0 , + ) ,
W ( x ( t ) ) W W ( x ( t 0 ) ) W e ( γ c / m ) ( t t 0 ) .
Using (7) again, we have
dist ( x ( t ) , E ) W ( x ( t ) ) W m W ( x ( t 0 ) ) W m e ( γ c / ( 2 m ) ) ( t t 0 ) .
The condition W W m dist 2 is a local quadratic growth (error–bound) near E. It makes the energy gap equivalent to the squared distance; thus, strict decay yields exponential convergence of both W and dist ( · , E ) . This assumption is standard and easily verified when W (or its potential Φ) satisfies a Polyak–Łojasiewicz inequality with a Lipschitz gradient. This condition implies the local quadratic growth (7) and, therefore, guarantees the exponential convergence established above.
Example 1
(exponential rate under PL). Consider the gradient flow x ˙ = Φ ( x ) with Φ ( x ) = k 2 x 2 ( k > 0 ). Then W = Φ , N 1 0 , N 2 = Φ ( x ) 2 = k 2 x 2 ; hence, W ˙ = N 2 = k 2 x 2 . Since Φ satisfies the Polyak–Łojasiewicz (PL) inequality Φ ( x ) 2 2 k [ Φ ( x ) Φ ( 0 ) ] , we obtain the local quadratic growth W W 1 k Φ ( x ) 2 , which matches (7). Therefore,
W ( x ( t ) ) W W ( x ( 0 ) ) W e 2 k t and dist ( x ( t ) , { 0 } ) = x ( t ) x ( 0 ) e k t ,
showing exponential convergence under the PL condition.
Compared with classical LaSalle or Matrosov theorems, the proposed composite framework relaxes smoothness and compactness assumptions and provides stronger quantitative outcomes. While traditional approaches conclude only qualitative convergence under uniform continuity and invariance conditions, the present method establishes explicit decay rates of the form W ˙ γ ( N 1 + N 2 ) and derives L 2 and O ( t 1 / 2 ) estimates for dist ( x ( t ) , E ) . Hence, it extends the scope of Lyapunov analysis to nonsmooth and noncompact settings while yielding sharper convergence conclusions. It also connects naturally with the Polyak–Łojasiewicz and Kurdyka–Łojasiewicz conditions in variational systems, showing that the strict-decay inequality unifies energy-based and error–bound approaches within a single quantitative framework.

2.6. Pointwise and Set Stability Results

The convergence results established so far show that trajectories approach the critical set E. The next step is to translate this asymptotic behavior into stability properties. Throughout this section, the analysis is carried out on bounded sublevels of the Lyapunov function W, ensuring that all trajectories considered remain bounded. By combining convergence to E with Lyapunov stability of its elements, we obtain pointwise asymptotic stability of the set, semistability of equilibria, and asymptotic stability of an equilibrium for all bounded trajectories (global if W is radially unbounded). These results summarize the qualitative behavior of the system and will later serve as the foundation for the applications.
We recall the notions of pointwise asymptotic stability (PAS) and semistability (SS) used in the statements below.
Definition 1
(Pointwise Asymptotic Stability). A set Z is said to be pointwise asymptotically stable (PAS) for (1) if:
  • ( A 1 ) every z Z is Lyapunov stable;
  • ( A 2 ) every solution x ( t ) of (1) converges and lim t x ( t ) Z , i.e., there exists δ > 0 such that x 0 z δ implies lim t x ( t ) = z Z .
Definition 2
(Semistability). An equilibrium x E f is said to be semistable (SS) if it satisfies ( A 1 ) and ( A 2 ) for Z = E f .
Pointwise asymptotic stability generalizes asymptotic stability from a single equilibrium to a possibly nonisolated set of equilibria. In noncompact or continuous equilibrium sets, classical asymptotic stability is no longer attainable, since nearby equilibria prevent isolation. In such settings, semistability provides the natural notion of convergence: each equilibrium is Lyapunov stable, and trajectories starting near the set converge to one of its elements.
We now state the main stability consequences of the convergence result established above.
Corollary 2
(Pointwise Asymptotic Stability of the Critical Set). Let
E : = { x R n : N 1 ( x ) = 0 , N 2 ( x ) = 0 } .
If every point of E is Lyapunov stable, then E is pointwise asymptotically stable (in the sense of Definition 1). Equivalently, every trajectory x ( · ) converges and its limit belongs to E.
Proof. 
By Theorem 3, every trajectory x ( · ) satisfies dist ( x ( t ) , E ) 0 as t ; hence, the ω –limit set of x ( · ) is contained in E. This verifies condition ( A 2 ) of Definition 1. By assumption, each point of E is Lyapunov stable, which is condition ( A 1 ). Therefore, both conditions hold, and E is pointwise asymptotically stable. □
The next result specializes this conclusion to the case where the critical set coincides with the equilibrium set.
Corollary 3
(Semistability of Equilibria). Suppose that the critical set
E : = { x R n : N 1 ( x ) = 0 , N 2 ( x ) = 0 }
coincides with the set of equilibria of the system. If every equilibrium in E is Lyapunov stable, then each equilibrium is semistable: every trajectory x ( · ) converges and its ω–limit set reduces to a single equilibrium in E.
Proof. 
By Theorem 3, every trajectory x ( · ) satisfies dist ( x ( t ) , E ) 0 as t ; hence, the ω –limit set of x ( · ) is contained in E. This guarantees convergence to equilibria. Since each equilibrium in E is Lyapunov stable, trajectories starting near an equilibrium cannot drift among different points of E, and thus must converge to a single equilibrium. This establishes semistability. □
Finally, when the critical set reduces to a single equilibrium, the result recovers global asymptotic stability.
Corollary 4
(Asymptotic Stability of an Equilibrium). If the critical set reduces to a singleton
E = { x } ,
then x is asymptotically stable for all bounded trajectories. If, in addition, the Lyapunov function W is radially unbounded (i.e., W ( x ) as x ), the result extends to global asymptotic stability.
Proof. 
By Theorem 3, every trajectory x ( · ) satisfies dist ( x ( t ) , E ) 0 as t . Since the analysis is carried out on bounded sublevels of W, the trajectories remain bounded. Because E consists of the single equilibrium x , this implies x ( t ) x . Hence, x is asymptotically stable for all bounded trajectories; if W is radially unbounded, the stability is global. □
Remark 9
(Set stability versus point stability). Classical Lyapunov theory is typically concerned with the asymptotic stability of an isolated equilibrium point x , where stability means that solutions starting near x remain close, and asymptotic stability means they converge to x . The framework developed here is more general. The critical set
E : = { x R n : N 1 ( x ) = 0 , N 2 ( x ) = 0 }
need not be a singleton: it may contain infinitely many equilibria or form a smooth manifold.
This extends the classical notion of asymptotic stability from isolated equilibria to general invariant sets. In such cases, it is natural to ask for the stability of the set E rather than of a single point. The strict-decay inequality ensures that dist ( x ( t ) , E ) 0 as t , establishing asymptotic stability of the set E. This generalization is particularly relevant for dynamical systems arising in optimization and control, such as the inertial gradient-like system and the Primal–Dual gradient flow studied in the next section.

3. Applications and Refined Results

3.1. Case Study I: Inertial Gradient-like System

In this case, we study the inertial gradient-like system studied in [15]. Compared with their approach, which relies on Opial’s lemma and weak convergence arguments, our framework uses a strict-decay inequality that makes the proof more direct. In addition, this allows us to establish semistability and strong convergence in the convex case. The same inertial gradient-like dynamics have also been recently analyzed using Lyapunov pairs to characterize stability [13], and through refined invariance principles, providing a precise location of the ω -limit set [16].
Let Φ : R n R be of class C 2 , bounded from below, and with Lipschitz continuous Hessian on bounded sets of R n . We consider the second-order dynamical system
x ¨ ( t ) + α x ˙ ( t ) + β 2 Φ ( x ( t ) ) x ˙ ( t ) + Φ ( x ( t ) ) = 0 , α , β > 0 .
This system can be equivalently written in the phase space as a first-order Cauchy problem. Introducing the variable y ( t ) = ( x ( t ) , v ( t ) ) with v ( t ) = x ˙ ( t ) , we obtain
x ˙ = v , v ˙ = α v Φ ( x ) β 2 Φ ( x ) v .
The corresponding equilibrium set is S = { ( x , v ) : v = 0 , Φ ( x ) = 0 } . Moreover, define the function
W ( x , v ) = ( α β + 1 ) Φ ( x ) + 1 2 v + β Φ ( x ) 2 .
A direct computation (see [15]), yields
W ˙ = α v 2 β Φ ( x ) 2 .
Introduce the observables
N 1 ( x , v ) : = v 2 , N 2 ( x , v ) : = Φ ( x ) 2 ,
so that
W ˙ = α N 1 β N 2 0 .
Since W is nonincreasing and bounded below, Proposition 1 applies and provides the integral bounds
0 N 1 ( y ( s ) ) d s < , 0 N 2 ( y ( s ) ) d s < ;
hence, x ˙ and Φ ( x ) belong to L 2 ( 0 , + ) . Now assume that the trajectory ( x ( t ) , v ( t ) ) is bounded. Then both Φ and 2 Φ are bounded on it. From the dynamics, v ˙ is bounded, so v is Lipschitz and N 1 is uniformly continuous. Moreover,
d d t Φ ( x ( t ) ) = 2 Φ ( x ( t ) ) v ( t )
is bounded; hence, Φ ( x ( t ) ) is Lipschitz and N 2 is uniformly continuous. By Proposition 1, the combination of strict decay and uniform continuity yields
N 1 ( y ( t ) ) 0 , N 2 ( y ( t ) ) 0 , t +
Therefore,
dist ( ( x ( t ) , v ( t ) ) , S ) 0 .
By Corollary 2, this shows the Pointwise Asymptotic Stability (PAS) of the critical set S = { y R n × R n : N 1 ( y ) = N 2 ( y ) = 0 } .
The above analysis shows that bounded trajectories converge to the critical set
S = { ( x , v ) R n × R n : v = 0 , Φ ( x ) = 0 } ,
establishing pointwise asymptotic stability in the sense of Corollary 2.
To go further, we now specialize in the case where Φ is convex. In this setting, the condition Φ ( x ) = 0 is equivalent to x Argmin Φ ; thus, the critical set reduces to
S = Argmin Φ × { 0 } .
Hence, convergence to S ensures that trajectories approach the minimizer set,
dist ( x ( t ) , Argmin Φ ) 0 .
While this guarantees convergence to the set of minimizers, it still leaves open the possibility of multiple cluster points within Argmin Φ . To address this and prove convergence to a single minimizer, we refine the Lyapunov construction by introducing a perturbed functional W ε . This perturbation anchors the dynamics at a reference minimizer and enables the application of the semistability result provided in Corollary 3.
To strengthen the convergence result in the convex case, we introduce a perturbed Lyapunov functional. Fix a reference point z Argmin Φ and, for small ε > 0 , define
W ε ( x , v ) = W ( x , v ) + ε α 2 x z 2 + v + β Φ ( x ) , x z .
This functional is equivalent to W and remains bounded from below. Differentiating along the trajectories of the system yields
W ˙ ε = α v 2 β Φ ( x ) 2 + ε v 2 + β Φ ( x ) , v Φ ( x ) , x z .
Since Φ is convex and z is a minimizer, the last inner product satisfies Φ ( x ) , x z 0 . We may, therefore, drop this term to obtain the upper bound
W ˙ ε α v 2 β Φ ( x ) 2 + ε v 2 + β Φ ( x ) , v .
The remaining cross-term can be estimated using Young’s inequality, as follows
β | Φ ( x ) , v | 1 2 v 2 + β 2 2 Φ ( x ) 2 .
For 0 < ε < min 2 3 α , 2 β and substituting the previous estimate leads to
W ˙ ε α 3 2 ε v 2 β β 2 2 ε Φ ( x ) 2 .
Therefore, there exists
c ε : = min α 3 2 ε , β β 2 2 ε > 0 ,
so that
W ˙ ε c ε v 2 + Φ ( x ) 2 = c ε ( N 1 + N 2 ) .
This inequality shows that W ε is nonincreasing and convergent. In particular, x ˙ and Φ ( x ) both belong to L 2 ( 0 , ) . Since the trajectory is bounded, the functions N 1 and N 2 are uniformly continuous along the trajectory, and Proposition 1 guarantees that
v ( t ) 0 and Φ ( x ( t ) ) 0 as t .
It remains to identify the limiting point. By construction, the difference between W ε and W is
W ε ( t ) W ( t ) = ε α 2 x ( t ) z 2 + v ( t ) + β Φ ( x ( t ) ) , x ( t ) z .
Both W ε and W converge to finite limits; thus, their difference does as well. The inner product term vanishes asymptotically because v ( t ) 0 and Φ ( x ( t ) ) 0 . Consequently, the limit of x ( t ) z exists for every minimizer z Argmin Φ .
Since x ( t ) is bounded, it admits cluster points. Every cluster point lies in Argmin Φ , but the existence of lim t x ( t ) z for all z forces the cluster set to be a singleton. Thus, the trajectory converges strongly to one minimizer,
x ( t ) x Argmin Φ .
In conclusion, the perturbed Lyapunov functional W ε establishes convergence of every bounded trajectory to a single minimizer. This corresponds to Semistability (SS) of the equilibria in the sense of Corollary 3: each equilibrium in E is Lyapunov stable, and every trajectory converges to one equilibrium. If the minimizer set is reduced to a singleton, then semistability and pointwise asymptotic stability coincide, and we recover classical asymptotic stability of the unique equilibrium (see Corollary 4).

3.2. Case Study II: Primal–Dual Gradient Flow

We now consider the Primal–Dual gradient flow, a continuous-time model for equality-constrained convex optimization problems. It is used in communication networks (resource allocation, congestion control), power systems, and decentralized control, and in analyses of first-order saddle-point methods for machine learning and inverse problems. Many works study this flow (see, for example, [17,18,19,20])
Here we treat the baseline model within our strict-decay framework and obtain asymptotic stability of the Karush–Kuhn–Tucker (KKT) set, with a semistability refinement.
Consider the equality-constrained convex optimization problem
min x R n Φ ( x ) subject to A x = b ,
where Φ : R n R is convex and continuously differentiable with locally Lipschitz gradient, A R m × n , and b R m .
Throughout this subsection, we assume that the constraint is feasible, i.e., A x = b admits at least one solution. If A x = b is infeasible, the KKT set is empty and the standard Primal–Dual flow may produce divergent multipliers; thus, the stability results below do not apply.
The Lagrangian is
L ( x , λ ) = Φ ( x ) + λ ( A x b ) ,
with multiplier λ R m . The Karush–Kuhn–Tucker conditions are
x L ( x , λ ) = Φ ( x ) + A λ = 0 , λ L ( x , λ ) = A x b = 0 .
Any pair ( x , λ ) satisfying them is a saddle point of L and a KKT equilibrium.
A natural continuous-time approach is the Primal–Dual (Arrow–Hurwicz–Uzawa) gradient flow:
x ˙ = x L ( x , λ ) , λ ˙ = λ L ( x , λ ) ,
i.e.,
x ˙ = Φ ( x ) A λ , λ ˙ = A x b .
This system, known as the Arrow–Hurwicz–Uzawa flow (see [21]), represents a continuous-time analog of the classical Primal–Dual algorithm. The variable x seeks to minimize the Lagrangian, while λ enforces the constraint by driving the residual A x b to zero.
The equilibrium (KKT) set is
S = { ( x , λ ) : Φ ( x ) + A λ = 0 , A x = b } .
For stability, use the Lyapunov functional
W ( x , λ ) = Φ ( x ) Φ ( x ) + 1 2 A x b 2 + 1 2 λ λ 2 ,
with ( x , λ ) S . Along trajectories,
W ˙ = A x b 2 Φ ( x ) + A λ 2 .
Define
N 1 ( x , λ ) = A x b 2 , N 2 ( x , λ ) = Φ ( x ) + A λ 2 ,
Then
W ˙ = N 1 N 2 .
This is a strict-decay identity in our framework. Since W is nonincreasing and bounded below, we have
0 N 1 ( x ( t ) , λ ( t ) ) d t < , 0 N 2 ( x ( t ) , λ ( t ) ) d t < .
Since W contains the quadratic term 1 2 λ λ 2 , any bounded sublevel of W ensures bounded multipliers λ ( t ) . We keep this assumption implicit and focus on the feasible case. If ( x ( t ) , λ ( t ) ) is bounded, local Lipschitzness of the vector field makes N 1 and N 2 uniformly continuous along the trajectory. By the integral-vanishing principle provided in Proposition 1,
N 1 ( t ) 0 , N 2 ( t ) 0 ;
thus,
A x ( t ) b , Φ ( x ( t ) ) + A λ ( t ) 0 .
Therefore,
dist ( ( x ( t ) , λ ( t ) ) , S ) 0 ,
establishing asymptotic stability of S. With a unique constrained minimizer, the trajectory converges to that KKT point; otherwise, it converges to the equilibrium set.
If the constrained minimizer is unique, then ( x ( t ) , λ ( t ) ) ( x , λ ) . A sufficient condition is that Φ is strictly convex on the affine subspace { x : A x = b } and A has full row rank, which also yields uniqueness of λ . If several constrained minimizers exist, trajectories converge to the entire KKT set S, showing semistability.
To capture semistability, perturb W by a skew term that couples primal and dual residuals. For ε > 0 , set
W ε ( x , λ ) : = W ( x , λ ) + ε x x , Φ ( x ) + A λ λ λ , A x b .
On bounded sublevels of W, the gradient Φ is L-Lipschitz; thus, W ε and W are equivalent for small ε .
To estimate W ˙ ε , note that since Φ is L-Lipschitz and x ( · ) is absolutely continuous,
d d t Φ ( x ( t ) ) = lim h 0 Φ ( x ( t + h ) ) Φ ( x ( t ) ) | h | L x ˙ ( t ) = L Φ ( x ) + A λ for a . e . t .
Using the system dynamics and this inequality, we have
d d t x x , Φ ( x ) + A λ = x ˙ , Φ ( x ) + A λ + x x , d d t Φ ( x ) + A λ ˙ = Φ ( x ) + A λ 2 + x x , A ( A x b ) + x x , d d t Φ ( x ) , d d t λ λ , A x b = λ ˙ , A x b + λ λ , A x ˙ = A x b 2 λ λ , A ( Φ ( x ) + A λ ) .
Substituting these expressions into W ˙ ε yields
W ˙ ε = W ˙ + ε d d t x x , · d d t λ λ , · = ( 1 + ε ) A x b 2 ( 1 + ε ) Φ ( x ) + A λ 2 + ε x x , A ( A x b ) λ λ , A ( Φ ( x ) + A λ ) + x x , d d t Φ ( x ) .
On a bounded sublevel of W, we estimate the cross-terms using the Cauchy–Schwarz and Young inequalities ( a b 2 η a 2 + 1 8 η b 2 with η > 0 ):
| x x , A ( A x b ) | A x x A x b 2 η 1 A x b 2 + A 2 8 η 1 x x 2 , | λ λ , A ( Φ ( x ) + A λ ) | A λ λ Φ ( x ) + A λ 2 η 2 Φ ( x ) + A λ 2 + A 2 8 η 2 λ λ 2 , | x x , d d t Φ ( x ) | x x d d t Φ ( x ) L x x Φ ( x ) + A λ 2 η 3 Φ ( x ) + A λ 2 + L 2 8 η 3 x x 2 .
Inserting these bounds into the previous inequality yields
W ˙ ε ( 1 + ε ) A x b 2 ( 1 + ε ) Φ ( x ) + A λ 2 + ε 2 η 1 A x b 2 + 2 ( η 2 + η 3 ) Φ ( x ) + A λ 2 + ε A 2 8 η 1 x x 2 + A 2 8 η 2 λ λ 2 + L 2 8 η 3 x x 2 .
Collecting coefficients gives
W ˙ ε 1 + ε 2 ε η 1 A x b 2 1 + ε 2 ε ( η 2 + η 3 ) Φ ( x ) + A λ 2 + ε R ( x , λ ) ,
where
R ( x , λ ) = A 2 8 η 1 x x 2 + A 2 8 η 2 λ λ 2 + L 2 8 η 3 x x 2 .
To control R by W, note that since x minimizes Φ , we have Φ ( x ) Φ ( x ) 0 , and therefore W ( x , λ ) 0 . Moreover,
λ λ 2 2 W ( x , λ ) , A x b 2 = A ( x x ) 2 A 2 x x 2 .
Working on a bounded sublevel { W W 0 } , which is compact since the trajectory is bounded, there exist α > 0 and r > 0 such that
x x 2 1 α W ( x , λ ) for ( x , λ ) ( x , λ ) r .
Outside this neighborhood, continuity on the compact set implies
δ : = min K W > 0 , M : = max { W W 0 } x x < ,
so that x x 2 ( M 2 / δ ) W ( x , λ ) for all ( x , λ ) K . Setting
C x = max 1 α , M 2 δ ,
we have x x 2 C x W ( x , λ ) on { W W 0 } , and thus
R ( x , λ ) A 2 8 η 1 + L 2 8 η 3 C x W ( x , λ ) + A 2 8 η 2 · 2 W ( x , λ ) = c 0 W ( x , λ ) ,
where
c 0 = A 2 8 η 1 + L 2 8 η 3 C x + A 2 4 η 2 .
Hence,
W ˙ ε a 1 A x b 2 a 2 Φ ( x ) + A λ 2 + ε c 0 W , a 1 = 1 + ε 2 ε η 1 , a 2 = 1 + ε 2 ε ( η 2 + η 3 ) .
On the same compact set, there exists κ > 0 such that
W ( x , λ ) κ A x b 2 + Φ ( x ) + A λ 2 ,
since both sides are continuous and vanish only at ( x , λ ) . Consequently,
ε c 0 W ε c 0 κ A x b 2 + Φ ( x ) + A λ 2 .
Choosing ε > 0 sufficiently small so that ε c 0 κ 1 2 min { a 1 , a 2 } , we obtain
W ˙ ε ( a 1 ε c 0 κ ) A x b 2 ( a 2 ε c 0 κ ) Φ ( x ) + A λ 2 .
Both coefficients are strictly positive, setting
c 1 = a 1 ε c 0 κ > 0 , c 2 = a 2 ε c 0 κ > 0 ,
we finally obtain
W ˙ ε c 1 A x b 2 c 2 Φ ( x ) + A λ 2 .
This shows that W ˙ ε is strictly negative outside equilibrium along bounded trajectories.
To conclude, the perturbed Lyapunov function W ε is positive definite with respect to the KKT set S and strictly decreases along trajectories outside S. Therefore, every KKT equilibrium is Lyapunov stable, and
A x ( t ) b 0 , Φ ( x ( t ) ) + A λ ( t ) 0 ,
whence
dist ( ( x ( t ) , λ ( t ) ) , S ) 0 .
Thus, S is semistable. If the constrained minimizer of Φ subject to A x = b is unique, the trajectory converges to that single KKT point.

Illustrative Example

To illustrate the result, consider the quadratic optimization problem
minimize Φ ( x ) = 1 2 x 2 , subject to x 1 + x 2 = 1 .
Here, A = [ 1 1 ] and b = 1 . The Karush–Kuhn–Tucker (KKT) conditions are
x + A λ = 0 , A x = b .
Solving these equations yields the unique KKT point
x = ( 0.5 , 0.5 ) , λ = 0.5 .
The corresponding Primal–Dual flow is
x ˙ = x A λ , λ ˙ = A x b .
For this system, the Lyapunov function
W ( x , λ ) = Φ ( x ) Φ ( x ) + 1 2 A x b 2 + 1 2 λ λ 2
satisfies
W ˙ = A x b 2 x + A λ 2 0 .
Hence, both residuals
r p ( t ) = A x ( t ) b , r d ( t ) = x ( t ) + A λ ( t ) ,
tend to zero as t . Therefore, the trajectory ( x ( t ) , λ ( t ) ) converges to the KKT point ( x , λ ) , confirming the strict-decay property and asymptotic stability predicted by the theory.

4. Conclusions

The paper developed a composite Lyapunov framework that establishes strict decay through a pair of differential inequalities. This construction provides a unified and generalized structure that encompasses both the classical Lyapunov method—based on single-function decay—and the Matrosov auxiliary–function framework, where multiple functions interact to ensure convergence. By merging these two perspectives into a single principle of composite decay inequalities, the approach delivers a direct and constructive path from decay estimates to integral bounds, convergence to the critical set, and stability of equilibria and invariant sets, all without relying on compactness or invariance assumptions. Applications to inertial gradient-like systems and Primal–Dual gradient flows illustrate how this unified framework captures semistability and convergence in optimization-driven dynamics while offering a transparent analytical tool for broader classes of nonlinear systems.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

We would like to express our sincere gratitude to the editor and the anonymous referees for their invaluable contributions to this research article. Their expertise, careful assessment, and constructive feedback have greatly enhanced the quality and rigor of our work. The authors gratefully acknowledge technical and financial support provided by Gulf University for Science and Technology (GUST), Kuwait.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Astolfi, A.; Praly, L. A LaSalle Version of Matrosov’s Theorem. In Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, Orlando, FL, USA, 12–15 December 2011; pp. 320–324. [Google Scholar]
  2. Khalil, H.K. Nonlinear Systems, 3rd ed.; Pearson Education, Prentice Hall: Upper Saddle River, NJ, USA, 2002. [Google Scholar]
  3. Matrosov, V.M. On the Stability of Motion. J. Appl. Math. Mech. 1962, 26, 1337–1353. [Google Scholar] [CrossRef]
  4. Loria, A.; Panteley, E.; Popovic, D.; Teel, A.R. A Nested Matrosov Theorem and Persistency of Excitation for Uniform Convergence in Stable Nonautonomous Systems. IEEE Trans. Autom. Control 2005, 50, 183–198. [Google Scholar] [CrossRef]
  5. Mazenc, F.; Nešić, D. Lyapunov Functions for Time–Varying Systems Satisfying Generalized Conditions of the Matrosov Theorem. Math. Control. Signals Syst. 2007, 19, 151–182. [Google Scholar] [CrossRef]
  6. Teel, A.R.; Nešić, D.; Lee, T.C.; Tan, Y. A Refinement of Matrosov’s Theorem for Differential Inclusions. Automatica 2016, 68, 378–383. [Google Scholar] [CrossRef]
  7. Goebel, R. Basic results on pointwise asymptotic stability and set-valued Lyapunov functions. In Proceedings of the 49th IEEE Conference on Decision and Control (CDC), Atlanta, GA, USA, 15–17 December 2010; pp. 1571–1574. [Google Scholar]
  8. Goebel, R.; Sanfelice, R.G. Notions and sufficient conditions for pointwise asymptotic stability in hybrid systems. IFAC-PapersOnLine 2016, 49, 140–145. [Google Scholar] [CrossRef]
  9. Bhat, S.P.; Bernstein, D.S. Lyapunov analysis of semistability. In Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251), San Diego, CA, USA, 2–4 June 1999; Volume 3, pp. 1608–1612. [Google Scholar]
  10. Hui, Q.; Haddad, W.M.; Bhat, S.P. Semistability, finite-time stability, differential inclusions, and discontinuous dynamical systems having a continuum of equilibria. IEEE Trans. Autom. Control 2009, 54, 2465–2470. [Google Scholar]
  11. Goebel, R.; Sanfelice, R.G. Pointwise asymptotic stability in a hybrid system and well-posed behavior beyond Zeno. SIAM J. Control Optim. 2018, 56, 1358–1385. [Google Scholar] [CrossRef]
  12. Saoud, H. Semistability of first-order evolution variational inequalities. Electron. J. Differ. Equ. 2015, 2015, 1–10. [Google Scholar]
  13. Saoud, H.; Théra, M.; Dao, M.N. Geometric Stability Analysis for Differential Inclusions Governed by Maximally Monotone Operators. arXiv 2025, arXiv:2507.13000. [Google Scholar] [CrossRef]
  14. Daher, W.; Mirman, L.J.; Santugini, M. Information in Cournot: Signaling with Incomplete Control. Int. J. Ind. Organ. 2012, 30, 361–370. [Google Scholar] [CrossRef]
  15. Alvarez, F.; Attouch, H.; Bolte, J.; Redont, P. A second-order gradient-like dissipative dynamical system with Hessian-driven damping: Application to optimization and mechanics. J. Math. Pures Appl. 2002, 81, 747–779. [Google Scholar] [CrossRef]
  16. Dao, M.N.; Saoud, H.; Théra, M. Locating theorems of differential inclusions governed by maximally monotone operators. SIAM J. Optim. 2023, 33, 2703–2720. [Google Scholar] [CrossRef]
  17. Feijer, D.; Paganini, F. Stability of Primal–Dual Gradient Dynamics and Applications to Network Optimization. Automatica 2010, 46, 1974–1981. [Google Scholar] [CrossRef]
  18. Cherukuri, A.; Mallada, E.; Cortés, J. Asymptotic Convergence of Constrained Primal–Dual Dynamics. Syst. Control Lett. 2016, 87, 10–15. [Google Scholar] [CrossRef]
  19. Ozaslan, I.K.; Patrinos, P.; Jovanović, M.R. Stability of primal-dual gradient flow dynamics for multi-block convex optimization problems. arXiv 2024, arXiv:2408.15969. [Google Scholar]
  20. Apidopoulos, V.; Molinari, C.; Peypouquet, J.; Villa, S. Preconditioned primal-dual dynamics in convex optimization: Non-ergodic convergence rates. arXiv 2025, arXiv:2506.00501. [Google Scholar]
  21. Arrow, K.J.; Hurwicz, L.; Uzawa, H. Studies in Linear and Nonlinear Programming; Stanford University Press: Stanford, CA, USA, 1958. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.