Elliptic polytopes are convex hulls of several concentric plane ellipses in Rd . They arise in applications as natural generalizations of usual polytopes. In particular, they define invariant convex bodies of linear operators, optimal Lyapunov norms for linear dynamical systems, etc. To construct elliptic polytopes one needs to decide whether a given ellipse is contained in the convex hull of other ellipses. We analyse the computational complexity of this problem and show that for d= 2 , 3 , it admits an explicit solution. For larger d, two geometric methods for approximate solution are presented. Both use the convex optimization tools. The efficiency of the methods is demonstrated in two applications: the construction of extremal norms of linear operators and the computation of the joint spectral radius/Lyapunov exponent of a family of matrices.
Elliptic polytopes and invariant norms of linear operators
Protasov, Vladimir
2023-01-01
Abstract
Elliptic polytopes are convex hulls of several concentric plane ellipses in Rd . They arise in applications as natural generalizations of usual polytopes. In particular, they define invariant convex bodies of linear operators, optimal Lyapunov norms for linear dynamical systems, etc. To construct elliptic polytopes one needs to decide whether a given ellipse is contained in the convex hull of other ellipses. We analyse the computational complexity of this problem and show that for d= 2 , 3 , it admits an explicit solution. For larger d, two geometric methods for approximate solution are presented. Both use the convex optimization tools. The efficiency of the methods is demonstrated in two applications: the construction of extremal norms of linear operators and the computation of the joint spectral radius/Lyapunov exponent of a family of matrices.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.