WHAT IS...a Spectrahedron?
From MaRDI portal
Publication:2813247
DOI10.1090/noti1116zbMath1338.52001OpenAlexW1969962394MaRDI QIDQ2813247
Publication date: 15 June 2016
Published in: Notices of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/noti1116
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to convex and discrete geometry (52-00)
Related Items
Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints ⋮ Matrix positivity preservers in fixed dimension. I ⋮ Robust optimization and data classification for characterization of Huntington disease onset via duality methods ⋮ Auxetic deformations and elliptic curves ⋮ Incompatibility in general probabilistic theories, generalized spectrahedra, and tensor norms ⋮ An exact formula for radius of robust feasibility of uncertain linear programs ⋮ On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets ⋮ Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems ⋮ Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems ⋮ Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs ⋮ Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization ⋮ A panorama of positivity. II: Fixed dimension ⋮ A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals ⋮ The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments ⋮ Iterated linear optimization ⋮ Noncommutative polynomials describing convex sets ⋮ Exact relaxations for parametric robust linear optimization problems ⋮ Conway topograph, -dynamics and two-valued groups ⋮ Random Spectrahedra ⋮ Complexity aspects of local minima and related notions ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations ⋮ Dimension-free entanglement detection in multipartite Werner states ⋮ Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
This page was built for publication: WHAT IS...a Spectrahedron?
