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.
Robust and Quadratic Stability via Polytopic Set Covering
GLIELMO L;
1995-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
