menu_book Explore the article's raw data

Polyhedral Robust Minkowski-Lyapunov Functions

Abstract

This article creates a numerical platform for practical utility of the recently introduced theoretical framework of robust Minkowski-Lyapunov functions. Systems of affine inequalities and equalities whose feasibility verifies the robust Lyapunov nature of polyhedral Minkowski functions with respect to the recently introduced robust Minkowski-Lyapunov inequality are derived. The theoretically exact verification of the robust Minkowski-Lyapunov inequality in the polyhedral setting is reduced to the feasibility stage of a linear program. The topological flexibility of the proposed methods is illustrated by two examples.

article Article
date_range 2024
language English
link Link of the paper
format_quote
Sorry! There is no raw data available for this article.
Loading references...
Loading citations...
Featured Keywords

Lyapunov methods
Linear matrix inequalities
Optimization
Numerical stability
Surveys
Stability criteria
Linear programming
Linear inclusions
Minkowski functions
polyhedral sets
robust Lyapunov functions
stability
Citations by Year

Share Your Research Data, Enhance Academic Impact