Elliptic polytopes and invariant norms of linear operators
DOI10.1007/s10092-023-00547-zzbMath1529.52003arXiv2107.02610OpenAlexW3182276233MaRDI QIDQ6142562
Thomas Mejstrik, Valdimir Yu. Protasov
Publication date: 4 January 2024
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.02610
Convex programming (90C25) Applications of mathematical programming (90C90) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Convexity and finite-dimensional Banach spaces (including special norms, zonoids, etc.) (aspects of convex geometry) (52A21) Stability theory for difference equations (39A30)
Cites Work
- Unnamed Item
- Unnamed Item
- Structure of extremal trajectories of discrete linear systems and the finiteness conjecture
- Iterative building of Barabanov norms and computation of the joint spectral radius for matrix sets
- Lyapunov indicator of discrete inclusions. I
- The generalized spectral radius and extremal norms
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- On stability analysis methods for large-scale discrete-time systems
- Regularity of multivariate vector subdivision schemes
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- Stability of discrete linear inclusion
- Exact computation of joint spectral characteristics of linear operators
- Optimal norms and the computation of joint spectral radius of matrices
- Duality results for the joint spectral radius and transient behavior
- Approximation of convex functions by projections of polyhedra
- Invariant Polytopes of Sets of Matrices with Application to Regularity of Wavelets and Subdivisions
- The Euler binary partition function and subdivision schemes
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Finding Extremal Complex Polytope Norms for Families of Real Matrices
- Limit theorems for the convex hull of random points in higher dimensions
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Algorithm 1011
- The Barabanov Norm is Generically Unique, Simple, and Easily Computed
- Optimal Switching Sequence for Switched Linear Systems
- Canonical Construction of Polytope Barabanov Norms and Antinorms for Sets of Matrices
- Some optimal inapproximability results
- Complex Polytope Extremality Results for Families of Matrices
- On Polyhedral Approximations of the Second-Order Cone
This page was built for publication: Elliptic polytopes and invariant norms of linear operators