Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations
From MaRDI portal
Publication:6039571
DOI10.1137/22m1513964arXiv2207.11986MaRDI QIDQ6039571
Publication date: 5 May 2023
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.11986
Convex programming (90C25) Groups as automorphisms of other structures (22F50) Functions of several variables (26Bxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral cones in Euclidean Jordan algebras
- The automorphism group of a completely positive cone and its Lie algebra
- On the bilinearity rank of a proper cone and Lyapunov-like transformations
- Analytic formulas for complete hyperbolic affine spheres
- Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
- Spectral sets and functions on Euclidean Jordan algebras
- Linear transformations preserving symmetric rank one matrices
- Obstructions to determinantal representability
- Bilinear optimality constraints for the cone of positive polynomials
- Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- On hyperbolicity cones associated with elementary symmetric polynomials
- Symmetry in semidefinite programs
- Positive operators on the \(n\)-dimensional ice cream cone
- Algebraic Perron-Frobenius theory
- On the automorphism group of a cone
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- A spectrahedral representation of the first derivative relaxation of the positive semidefinite cone
- On Nesterov's approach to semi-infinite programming
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Some geometric results in semidefinite programming
- Tight bounds on Lyapunov rank
- Spectral linear matrix inequalities
- On the irreducibility, Lyapunov rank, and automorphisms of special Bishop-Phelps cones
- Hyperbolic programs, and their derivative relaxations
- The lattice of faces of a finite dimensional cone
- Hyperbolic Polynomials and Convex Analysis
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Linear matrix inequality representation of sets
- Several Jordan-algebraic aspects of optimization†
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- Convex Analysis on the Hermitian Matrices
- On the derivative cones of polyhedral cones
- Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
- Spectral Properties of Matrices which have Invariant Cones
- Handbook of semidefinite programming. Theory, algorithms, and applications
- An improved bound for the Lyapunov rank of a proper cone
- Spectrahedral cones generated by rank \(1\) matrices
This page was built for publication: Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations