Gradient algorithms for finding common Lyapunov functions

Daniel Liberzon, Roberto Tempo

Research output: Contribution to journalConference articlepeer-review

Abstract

This paper is concerned with the problem of finding a quadratic common Lyapunov function for a large family of stable linear systems. We present gradient iteration algorithms which give deterministic convergence for finite system families and probabilistic convergence for infinite families.

Original languageEnglish (US)
Pages (from-to)4782-4787
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume5
StatePublished - 2003
Event42nd IEEE Conference on Decision and Control - Maui, HI, United States
Duration: Dec 9 2003Dec 12 2003

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Gradient algorithms for finding common Lyapunov functions'. Together they form a unique fingerprint.

Cite this