Semidefinite Optimization and Convex Algebraic Geometry

DOI10.1137/1.9781611972290zbMATH Open1260.90006OpenAlexW653291882MaRDI QIDQ4902572FDOQ4902572

Authors:

Publication date: 16 January 2013

Full work available at URL: https://doi.org/10.1137/1.9781611972290

Mathematics Subject Classification ID

Semidefinite programming (90C22) Collections of articles of miscellaneous specific interest (00B15) Computational aspects related to convexity (52B55) Real algebraic sets (14P05) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Cited In (only showing first 100 items - show all)

• Tropical spectrahedra
• Optimal bounds on the positivity of a matrix from a few moments
• The tropical analogue of the Helton-Nie conjecture is true
• Do sums of squares dream of free resolutions?
• Eigenconfigurations of tensors
• An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
• Imaginary projections of polynomials
• A semidefinite hierarchy for containment of spectrahedra
• A Positivstellensatz for sums of nonnegative circuit polynomials
• Real zeros of SONC polynomials
• A Morse theoretic approach to non-isolated singularities and applications to optimization
• Sampling algebraic varieties for sum of squares programs
• Matroids on Eight Elements with the Half-Plane Property and Related Concepts
• Semidefinite approximations of the matrix logarithm
• Determinantal sampling designs
• Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization
• On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
• Dilations, Linear Matrix Inequalities, the Matrix Cube Problem and Beta Distributions
• Minimizer Extraction in Polynomial Optimization Is Robust
• Semidefinite Descriptions of the Convex Hull of Rotation Matrices
• Numerical algebraic geometry and semidefinite programming
• Representations of Lie algebras by non-skewselfadjoint operators in Hilbert space
• Sums of squares and varieties of minimal degree
• Positive univariate trace polynomials
• On new classes of nonnegative symmetric tensors
• Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
• Alternative SDP and SOCP approximations for polynomial optimization
• A Sum of Squares Characterization of Perfect Graphs
• Plurisubharmonic noncommutative rational functions
• Symmetric sums of squares over \(k\)-subset hypercubes
• Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
• Noncommutative polynomials describing convex sets
• An SOS counterexample to an inequality of symmetric functions
• Defect of Euclidean distance degree
• On the central path of semidefinite optimization: degree and worst-case convergence rate
• Geometry of free loci and factorization of noncommutative polynomials
• On representing the positive semidefinite cone using the second-order cone
• The dual cone of sums of non-negative circuit polynomials
• Parameter Region for Multistationarity in \({\boldsymbol{n-}}\)Site Phosphorylation Networks
• Bianalytic maps between free spectrahedra
• Characterizing bad semidefinite programs: normal forms and short proofs
• Conic stability of polynomials
• Schur polynomials and matrix positivity preservers
• Bad projections of the PSD cone
• Region of attraction estimation using invariant sets and rational Lyapunov functions
• Sum-of-squares methods for controlled invariant sets with applications to model-predictive control
• Gram spectrahedra
• Real root finding for determinants of linear matrices
• Analysis of optimization algorithms via sum-of-squares
• Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
• Exact algorithms for linear matrix inequalities
• A symbolic algebra for the computation of expected utilities in multiplicative influence diagrams
• Spaces of sums of powers and real rank boundaries
• Real radicals and finite convergence of polynomial optimization problems
• On a few statistical applications of determinantal point processes
• Some remarks on duality and optimality of a class of constrained convex quadratic minimization problems
• The rational interpolation problem: Grassmannian and Loewner-matrix approaches
• A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
• The multidimensional truncated moment problem: Carathéodory numbers from Hilbert functions
• Bad semidefinite programs: they all look the same
• Automorphisms of hyper-Reinhardt free spectrahedra
• Sums of squares and sparse semidefinite programming
• On sums of squares of \(K\)-nomials
• Bounds for deterministic and stochastic dynamical systems using sum-of-squares optimization
• Spectrahedral shadows
• Initial steps in the classification of maximal mediated sets
• Inflation of poorly conditioned zeros of systems of analytic functions
• The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
• Computing symmetric determinantal representations
• Sums of squares in Macaulay2
• The saddle point problem of polynomials
• Discriminants of cyclic homogeneous inequalities of three variables
• Advances in computational Lyapunov analysis using sum-of-squares programming
• Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
• Test sets for nonnegativity of polynomials invariant under a finite reflection group
• Stochastic polynomial optimization
• Matrix convex hulls of free semialgebraic sets
• Livsic-type determinantal representations and hyperbolicity
• Amoebas, nonnegative polynomials and sums of squares supported on circuits
• Extreme points of matrix convex sets, free spectrahedra, and dilation theory
• Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
• Polyhedral approximations of the semidefinite cone and their application
• Lower bounds on complexity of Lyapunov functions for switched linear systems
• Learning algebraic varieties from samples
• Convergent conic linear programming relaxations for cone convex polynomial programs
• The geometry of SDP-exactness in quadratic optimization
• Tensor theta norms and low rank recovery
• Random points on an algebraic manifold
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations
• Scheduling meets \(n\)-fold integer programming
• Semidefinite Representation for Convex Hulls of Real Algebraic Curves
• Algebraic boundaries of convex semi-algebraic sets
• Matrix positivity preservers in fixed dimension. I
• A complete characterization of determinantal quadratic polynomials
• On the local stability of semidefinite relaxations
• Exponential varieties
• On duality gap with polynomial multipliers for polynomial optimization problems
• Geometric control of hybrid systems
• Euclidean distance degree of the multiview variety
• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank

Uses Software

• Macaulay2
• NCSOStools
• NCAlgebra

This page was built for publication: Semidefinite Optimization and Convex Algebraic Geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4902572)