Premium
Robust and quadratic stability via polytopic set covering
Author(s) -
Amato F.,
Garofalo F.,
Glielmo L.,
Pironti A.
Publication year - 1995
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.4590050806
Subject(s) - polytope , convergence (economics) , mathematical optimization , stability (learning theory) , context (archaeology) , quadratic equation , set (abstract data type) , function (biology) , mathematics , computer science , quadratic programming , algorithm , combinatorics , paleontology , geometry , machine learning , evolutionary biology , economics , biology , programming language , economic growth
In this paper we consider the problem of covering the image of a given function by a polytope. This problem arises in both the robust and quadratic stability context. We present two main algorithms: the first one performs such a covering and works under quite general assumptions on the nature of the function; the second one is iterative and allows us to improve at will the goodness of the covering. The convergence properties of this algorithm are also discussed. Finally two examples of application of our techniques are presented.