Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma

Tobias Leth, Christoffer Sloth, Rafal Wisniewski, Sriram Sankaranarayanan

Research output: Contribution to journalConference article in JournalResearchpeer-review

62 Downloads (Pure)

Abstract

In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.
Original languageEnglish
Book seriesIFAC-PapersOnLine
Volume50
Issue number1
Pages (from-to)1667-1672
ISSN2405-8963
DOIs
Publication statusPublished - 10 Jul 2017
Event2017 IFAC Congress -
Duration: 9 Jul 201714 Jul 2017
https://www.ifac2017.org/

Conference

Conference2017 IFAC Congress
Period09/07/201714/07/2017
Internet address

Cite this

Leth, Tobias ; Sloth, Christoffer ; Wisniewski, Rafal ; Sankaranarayanan, Sriram. / Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma. In: IFAC-PapersOnLine. 2017 ; Vol. 50, No. 1. pp. 1667-1672.
@inproceedings{cd6921ebf4f3432f84860b4d763b9855,
title = "Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma",
abstract = "In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.",
author = "Tobias Leth and Christoffer Sloth and Rafal Wisniewski and Sriram Sankaranarayanan",
year = "2017",
month = "7",
day = "10",
doi = "10.1016/j.ifacol.2017.08.339",
language = "English",
volume = "50",
pages = "1667--1672",
journal = "I F A C Workshop Series",
issn = "1474-6670",
publisher = "Elsevier",
number = "1",

}

Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma. / Leth, Tobias; Sloth, Christoffer; Wisniewski, Rafal; Sankaranarayanan, Sriram.

In: IFAC-PapersOnLine, Vol. 50, No. 1, 10.07.2017, p. 1667-1672.

Research output: Contribution to journalConference article in JournalResearchpeer-review

TY - GEN

T1 - Lyapunov Function Synthesis - Infeasibility and Farkas' Lemma

AU - Leth, Tobias

AU - Sloth, Christoffer

AU - Wisniewski, Rafal

AU - Sankaranarayanan, Sriram

PY - 2017/7/10

Y1 - 2017/7/10

N2 - In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.

AB - In this paper we prove the convergence of an algorithm synthesising continuous piecewise-polynomial Lyapunov functions for polynomial vector elds dened on simplices. We subsequently modify the algorithm to sub-divide locally by utilizing information from infeasible linear problems. We prove that this modication does not destroy the convergence of the algorithm. Both methods are accompanied by examples.

U2 - 10.1016/j.ifacol.2017.08.339

DO - 10.1016/j.ifacol.2017.08.339

M3 - Conference article in Journal

VL - 50

SP - 1667

EP - 1672

JO - I F A C Workshop Series

JF - I F A C Workshop Series

SN - 1474-6670

IS - 1

ER -