Some geometric results in semidefinite programming

DOI10.1007/BF01100204zbMath0839.90093OpenAlexW2065706751MaRDI QIDQ1905963

Publication date: 23 January 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01100204

zbMATH Keywords

semidefinite programs convex geometry spectrahedra algebraic polar

Mathematics Subject Classification ID

Convex programming (90C25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Related Items

Nonnegative polynomials and sums of squares, Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems, Extreme points of Gram spectrahedra of binary forms, Robust optimization and data classification for characterization of Huntington disease onset via duality methods, Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors, Geometry of free loci and factorization of noncommutative polynomials, Facial structure of matrix convex sets, Some Recent Developments in Spectrahedral Computation, Extreme points of matrix convex sets, free spectrahedra, and dilation theory, On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty, Algebraic boundaries of \(\mathrm{SO}(2)\)-orbitopes, Incompatibility in general probabilistic theories, generalized spectrahedra, and tensor norms, An exact formula for radius of robust feasibility of uncertain linear programs, On the approximation of unbounded convex sets by polyhedra, Do Sums of Squares Dream of Free Resolutions?, Deciding Polyhedrality of Spectrahedra, Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations, Empirical Properties of Optima in Free Semidefinite Programs, 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, A variational principle for ground spaces, A STOCHASTIC APPROXIMATION ALGORITHM FOR STOCHASTIC SEMIDEFINITE PROGRAMMING, Polyhedral approximation of spectrahedral shadows via homogenization, Characterizing a class of robust vector polynomial optimization via sum of squares conditions, The face lattice of the set of reduced density matrices and its coatoms, A complete characterization of determinantal quadratic polynomials, Classifying linear matrix inequalities via abstract operator systems, On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems, Convex geometry and its applications. Abstracts from the workshop held December 12--18, 2021 (hybrid meeting), Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization, Polynomials with and without determinantal representations, 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, Polyhedral faces in Gram spectrahedra of binary forms, Definite determinantal representations via orthostochastic matrices, Singularities and genus of the \(k\)-ellipse, Graph rigidity via Euclidean distance matrices, Definite determinantal representations of multivariate polynomials, On sums of squares of \(K\)-nomials, A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals, Livsic-type determinantal representations and hyperbolicity, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, The radius of robust feasibility of uncertain mathematical programs: a survey and recent developments, Universal rigidity of bar frameworks via the geometry of spectrahedra, On semidefinite representations of non-closed sets, An introduction to matrix convex sets and free spectrahedra, Stable and real-zero polynomials in two variables, Sharp degree bounds for sum-of-squares certificates on projective curves, Quantum convex support, Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems, Generalized Farkas lemma with adjustable variables and two-stage robust linear programs, Spectrahedral cones generated by rank \(1\) matrices, Sums of squares and varieties of minimal degree, Exact relaxations for parametric robust linear optimization problems, Operator systems and convex sets with many normal cones, The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\), Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones, Exact Algorithms for Linear Matrix Inequalities, Symmetry Adapted Gram Spectrahedra, Random Spectrahedra, Complexity aspects of local minima and related notions, Semidefinite Descriptions of the Convex Hull of Rotation Matrices, LMI Representations of Convex Semialgebraic Sets and Determinantal Representations of Algebraic Hypersurfaces: Past, Present, and Future, A Semidefinite Hierarchy for Containment of Spectrahedra, Gram spectrahedra of ternary quartics, Generic Spectrahedral Shadows, Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty

Cites Work