---
title: Control Lyapunov Functions (CLFs)
url: https://www.emergentmind.com/topics/control-lyapunov-functions-clfs
type: topic
---

# Control Lyapunov Functions (CLFs)

A Control Lyapunov Function (CLF) is a scalar function that certifies the stabilizability of a dynamical system to a target set or point via feedback, generalizing the classical Lyapunov function by allowing selection of a stabilizing control at each state. CLFs are central in nonlinear control theory for characterizing regions of attraction, synthesizing stabilizing feedback laws, and integrating optimality, robustness, or constraints into closed-loop design. They serve as both a certificate of stabilizability and as a structural tool for constructive controller synthesis, unifying geometric and optimization-based approaches. The concept has been extended via viscosity solutions, Hamilton–Jacobi theory, sum-of-squares relaxations, learning-based synthesis, and compositional analysis for large-scale and uncertain systems.

## 1. Mathematical Foundations

A CLF is defined for a control-affine system
\[
\dot{x} = f(x) + g(x)u,\quad u\in U\subset\mathbb{R}^m,\ x\in\mathbb{R}^n
\]
as a smooth or continuous function \( V : D \to \mathbb{R}_+ \) on a domain \( D \) containing the target (usually the origin), satisfying:

- **Positive definiteness**: \( V(0)=0 \), \( V(x)>0 \) for \( x\neq 0 \)
- **Dissipation condition**: For all \( x\in D \), there exists \( u\in U \) such that
  \[
  \nabla V(x)\cdot (f(x) + g(x)u) \leq -\gamma V(x)
  \]
  for some \( \gamma>0 \) (exponential decay), or more generally, for some positive definite function \( \alpha(V(x)) \).

In minimum form, this is
\[
\inf_{u\in U} \big[\,\nabla V(x)\cdot(f(x) + g(x)u)\,\big] \leq -\gamma V(x) \qquad \forall x \in D
\]
[2404.01829]. For discrete-time or switched systems, analogous one-step or mode-dependent decreases are required [1908.09660, 1509.03688].

The classical construction is extended to value functions of optimal control or exit-time problems, giving rise to control Lyapunov–value functions (CLVFs) [2404.01829, 2403.03455, 1906.02703]:
\[
V_\gamma^*(x) = \inf_{u(\cdot) \in \mathcal{U}} \sup_{w(\cdot)\in \mathcal{W}} \max_{s\in [t,0]} e^{\gamma(s-t)} \ell(x(s))
\]
which are viscosity solutions to Hamilton–Jacobi–Bellman or Isaacs variational inequalities [2403.03455].

## 2. Feedback Synthesis and Sontag’s Formula

CLFs provide a constructive path to feedback synthesis. For scalar and multi-input affine systems, Sontag’s universal formula yields a continuous feedback law directly from the CLF and its derivatives such that the closed-loop system is globally stabilizing wherever the CLF condition holds [2602.04756, 2403.14226]. For a CLF \( V \) and quadratic weights \( Q, R \), this continuously blends Lyapunov decrease with optimality:

\[
u_S(x) = \begin{cases}
-\,R^{-1} b(x)^\top \,\lambda(x), & b(x) \neq 0 \\
0, & b(x) = 0
\end{cases}
\]
with
\[
a(x) = L_f V(x), \;\; b(x) = L_G V(x),
\]
\[
\lambda(x) = \frac{a(x) + \sqrt{a(x)^2 + x^\top Q x\ [b(x)R^{-1}b(x)^\top]}}{b(x)R^{-1}b(x)^\top}
\]
guaranteeing \(\dot{V}(x) < 0 \) for all \( x\neq 0 \) where \( V \) is a CLF [2602.04756]. Near equilibrium, this recovers LQR feedback exactly, and more generally, it minimizes an implicit CLF-dependent cost.

For systems with constraints (on state, input, or safety), the stabilizing controller can be computed pointwise as the solution to a convex quadratic program (CLF-QP), ensuring that the CLF decrease condition is respected [2404.01829, 2210.00629, 1903.01577]:

\[
\begin{aligned}
&\min_{u\in U}\; \|u - u_{ref}\|^2 \\
&\text{s.t.}\;\; \nabla V(x)\cdot[f(x) + g(x)u] \leq -\gamma V(x)
\end{aligned}
\]

## 3. Computational Methods: Value Function, Sum-of-Squares, and Learning

**Value function methods.** Construction of CLFs via solving Hamilton–Jacobi partial differential equations provides non-smooth CLVFs that are valid for general nonlinear and disturbed systems, encoding both target invariance and explicit exponential convergence [2403.03455, 2404.01829, 1906.02703]. The solution \( V^* \) is synthesizable by grid-based time-marching or curse-of-dimensionality-free local programming [1906.02703].

**Sum-of-squares (SOS) and polynomial techniques.** For polynomial systems, convex or bilinear SOS programming provides certificates of the CLF condition (and, when paired with CBFs, joint feasibility) [2305.01222, 2210.00629, 2406.18914]. For fixed polynomial degree, necessary and sufficient conditions become SOS feasibility conditions via the Positivstellensatz. Compositional, bilinear-alternation or specialized merging techniques (e.g., control-sharing) facilitate the construction of CLFs for constrained settings [1803.10689, 2210.00629].

**Data-driven and neural methods.** Learning-based approaches parameterize the CLF (and sometimes the controller) with neural networks, leveraging inductive biases to enforce CLF positivity, nulling at equilibrium, and monotonic decrease outside actuator-saturation regions [2511.01283, 2303.09678]. End-to-end direct minimization of Lyapunov-risk losses across sampled state points, optionally augmented by geometric shaping or controller regularization, accelerates both convergence rate and region of attraction size over prior learner-verifier frameworks.

**Compositional and decomposition-based synthesis.** For high-dimensional or large-scale systems, system decomposition and compositional CLF construction enable tractable synthesis: breaking a system into self-contained subsystems, computing low-dimensional CLVFs, and reconstructing a global CLF via max, sum, or admissible control set projection [2404.01829, 2403.03455].

## 4. CLFs in Control System Design: Strictness, Barriers, and Constraints

Strict CLFs quantify robustness and rate of convergence by enforcing uniform exponential decay, yielding explicit $\mathcal{KL}$-estimates and infinite gain margins [2509.25575]. For nonholonomic and underactuated systems, special coordinate choices and modular decomposition have produced globally strict CLFs paired with inverse-optimal controller redesigns.

**Barrier CLFs** encode invariance principles for safety-critical systems: "barrier variants" diverge or penalize trajectories near constraint boundaries, ensuring almost-global stabilization away from a zero-measure exclusion set [2509.25575]. Merging CLFs with barrier functions is addressed via joint convex or SOS formulations, with compatibility certificates (e.g., via Farkas’ Lemma and Positivstellensatz) guaranteeing simultaneous feasibility for the closed-loop controller [2403.14226, 2406.18914, 2305.01222].

Input and state constraints are incorporated into CLF synthesis through explicit feasibility conditions at control set vertices, via polyhedral, piecewise-affine, or robust convex programming [2503.16076, 2210.00629]. For discrete-time and hybrid systems, finite-step, flexible, or non-zeno CLFs permit contraction (or regulated non-monotonicity) over blocks or dwell intervals [1908.09660, 1003.0634, 1509.03688].

## 5. Extensions: Robust, Learning-based, and High-Dimensional CLFs

**Robust CLFs** (R-CLVFs) extend the CLF concept to systems under bounded disturbances, via min–max Hamilton–Jacobi–Isaacs value functions with explicit robust control-invariant sets and regions of exponential stabilizability [2403.03455, 2404.01829]. Regions of attraction shrink with target decay rate but guarantee convergence within the constructed domain.

Learning-based frameworks optimize CLFs and controllers directly from data, leveraging online or episodic updates. Neural ISS-CLFs proved for systems with unstructured uncertainties provide forward invariance and input-to-state stability under learned controllers when the CLF gradient is bounded [2303.09678, 2511.01283].

For high-dimensional systems, decomposition-based CLF/CLVF synthesis (e.g., for quadrotors or coupled ODE-PDE systems) overcomes the curse of dimensionality by reconstructing the global value function from tractable subsystem computations, with exactness or Lipschitz continuity proven under system-specific admissibility conditions [2404.01829]. 

## 6. Applications and Implementation

CLFs underpin a wide spectrum of applications, including:

- Nonlinear tracking and stabilization of robotic manipulators, vehicles, or generic nonlinear plants via CLF-QP, NMPC-CLF, or data-driven feedback [2006.01229, 1903.01577, 1804.05285].
- Global stabilization of nonholonomic systems (e.g., unicycle, ballbot) via modular strict CLFs and robust feedback with explicit convergence guarantees [2509.25575].
- Model predictive control for discrete-time nonlinear systems employing fs-CLFs for contractive or robust stability under interleaved optimization [1908.09660].
- Constrained LQ stabilization via CLF merging, maximizing safety and local optimality under hard state constraints [1803.10689].
- Boundary stabilization of distributed parameter systems (e.g., 1D parabolic PDEs) using structured CLFs for exponential decay [1905.01701].
- Certification and synthesis of safe-stabilizable regions for nonlinear plants with polynomial barriers and constraints, utilizing SOS convex programs [2210.00629, 2305.01222, 2406.18914].

Prototype implementations utilize direct transcription, QP solvers, SOS toolboxes (Mosek, SOSTOOLS), or deep learning frameworks, exploiting parallelization and compositionality to address high dimension or real-time constraints.

## 7. Theoretical and Practical Impact

The control Lyapunov function framework represents a unifying language for stability analysis, controller synthesis, and performance robustification in nonlinear, hybrid, and high-dimensional systems. Contemporary advances have closed key theoretical gaps in compatibility (e.g., CLF–CBF), computational tractability (e.g., system decomposition, sum-of-squares), and data-driven synthesis (e.g., end-to-end neural CLF optimization with inductive bias). Numerically robust and scalable algorithms now exist for a wide range of control tasks, including global/inverse-optimal stabilization, constraint and barrier handling, and robust safe learning.

Current research trends address compositional and distributed synthesis for networked systems, extensions to stochastic or risk-sensitive settings, online and adaptive CLF learning, and further integration of formal methods for certification and verification in increasingly uncertain and high-dimensional environments [2404.01829, 2406.18914, 2503.16076, 2303.09678].

Source: https://www.emergentmind.com/topics/control-lyapunov-functions-clfs