The following pages link to WHAT IS...a Spectrahedron? (Q2813247):
Displaying 28 items.
- Matrix positivity preservers in fixed dimension. I (Q291760) (← links)
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals (Q501263) (← links)
- Auxetic deformations and elliptic curves (Q1647847) (← links)
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization (Q1728358) (← links)
- Noncommutative polynomials describing convex sets (Q2031064) (← links)
- Complexity aspects of local minima and related notions (Q2074805) (← links)
- Dimension-free entanglement detection in multipartite Werner states (Q2099794) (← links)
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty (Q2108799) (← links)
- Robust optimization and data classification for characterization of Huntington disease onset via duality methods (Q2139276) (← links)
- Incompatibility in general probabilistic theories, generalized spectrahedra, and tensor norms (Q2159229) (← links)
- The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments (Q2242324) (← links)
- Exact relaxations for parametric robust linear optimization problems (Q2294277) (← links)
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints (Q2363578) (← links)
- An exact formula for radius of robust feasibility of uncertain linear programs (Q2401515) (← links)
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
- A panorama of positivity. II: Fixed dimension (Q3295975) (← links)
- On the Exactness of Lasserre Relaxations for Compact Convex Basic Closed Semialgebraic Sets (Q4571879) (← links)
- Iterated linear optimization (Q5157412) (← links)
- Conway topograph, -dynamics and two-valued groups (Q5220231) (← links)
- Random Spectrahedra (Q5237461) (← links)
- Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs (Q5243181) (← links)
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs (Q5376453) (← links)
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations (Q5501234) (← links)
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)
- Exact SDP reformulations for adjustable robust quadratic optimization with affine decision rules (Q6655784) (← links)
- Stability properties for parametric linear programs under data ambiguities (Q6663112) (← links)
