Computation of Lyapunov functions for smooth nonlinear systems using convex optimization (Q5925915)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1574256
Language Label Description Also known as
default for all languages
No label defined
    English
    Computation of Lyapunov functions for smooth nonlinear systems using convex optimization
    scientific article; zbMATH DE number 1574256

      Statements

      Computation of Lyapunov functions for smooth nonlinear systems using convex optimization (English)
      0 references
      0 references
      4 November 2001
      0 references
      uniform exponential stability
      0 references
      Lyapunov function
      0 references
      nonautonomous nonlinear systems
      0 references
      convex optimization
      0 references
      linear inequality constraints
      0 references
      0 references
      0 references
      This work presents a computational approach for searching a Lyapunov function for the equilibrium point \(x= 0\) for a class of nonautonomous nonlinear systems \(\dot x= f(x,\theta)\), where \(x\in\mathbb{R}^n\) is the state vector, \(\theta\in \mathbb{R}^\alpha\) is a possibly time-varying parameter vector, \(f(0,\theta)= 0\), and for all \(\theta\), \(f(x,\theta)\) is smooth. The Lyapunov function is considered in the form \(V(x)= x^T P(x)x\), where \(P(x)= \sum^N_{i=1} P_i\rho_i(x)\), \(\rho_i(x)\) are smooth basis-functions and \(P_i\) are parameter matrices. The parameter matrices are sought from the condition, \(\dot V\leq -\gamma V(x)\), where \(\gamma> 0\). The last condition is the condition of exponential stability of the equilibrium point.NEWLINENEWLINENEWLINEThe main contribution of this paper is the utilization of a flexible and general smooth parameterization of the Lyapunov function candidates that does not introduce significant conservativeness and the problem is reduced to a convex optimization problem involving linear inequality constraints at each point in the state space.
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references