Semidefinite Optimization and Convex Algebraic Geometry
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Representations of Lie algebras by non-skewselfadjoint operators in Hilbert space
- Symmetry in Turán sums of squares polynomials from flag algebras
- Geometry of free loci and factorization of noncommutative polynomials
- Extreme points of matrix convex sets, free spectrahedra, and dilation theory
- A symbolic algebra for the computation of expected utilities in multiplicative influence diagrams
- A complete characterization of determinantal quadratic polynomials
- Symmetric sums of squares over \(k\)-subset hypercubes
- Convergent conic linear programming relaxations for cone convex polynomial programs
- Semidefinite approximations of the matrix logarithm
- Livsic-type determinantal representations and hyperbolicity
- Bianalytic maps between free spectrahedra
- Discriminants of cyclic homogeneous inequalities of three variables
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Learning algebraic varieties from samples
- On sums of squares of \(K\)-nomials
- Numerical algebraic geometry and semidefinite programming
- Tropical spectrahedra
- Optimal bounds on the positivity of a matrix from a few moments
- Spaces of sums of powers and real rank boundaries
- The tropical analogue of the Helton-Nie conjecture is true
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Imaginary projections of polynomials
- Real zeros of SONC polynomials
- Positive univariate trace polynomials
- An SOS counterexample to an inequality of symmetric functions
- Polyhedral approximations of the semidefinite cone and their application
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
- Noncommutative polynomials describing convex sets
- The dual cone of sums of non-negative circuit polynomials
- The multidimensional truncated moment problem: Carathéodory numbers from Hilbert functions
- Bad projections of the PSD cone
- Analysis of optimization algorithms via sum-of-squares
- Tensor theta norms and low rank recovery
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
- Dimension-free entanglement detection in multipartite Werner states
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- B-subdifferential of the projection onto the generalized spectraplex
- Sparse moments of univariate step functions and allele frequency spectra
- Extremal cubics on the circle and the 2-sphere
- Intersection bodies of polytopes
- Efficient sampling in spectrahedra and volume approximation
- Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems
- On the local stability of semidefinite relaxations
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
- Duality of sum of nonnegative circuit polynomials and optimal SONC bounds
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- Certifying the global optimality of quartic minimization over the sphere
- The saddle point problem of polynomials
- Sum-of-squares methods for controlled invariant sets with applications to model-predictive control
- Computing symmetric determinantal representations
- Sums of squares in Macaulay2
- The geometry of SDP-exactness in quadratic optimization
- Generating valid linear inequalities for nonlinear programs via sums of squares
- Defect of Euclidean distance degree
- Polyhedral faces in Gram spectrahedra of binary forms
- Definite determinantal representations via orthostochastic matrices
- A Morse theoretic approach to non-isolated singularities and applications to optimization
- A note on convex relaxations for the inverse eigenvalue problem
- A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
- A straightforward proof of the polynomial factorization of a positive semi-definite polynomial matrix
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Sharp degree bounds for sum-of-squares certificates on projective curves
- Hierarchical multistage Gaussian signaling games in noncooperative communication and control systems
- Alternative SDP and SOCP approximations for polynomial optimization
- Exact relaxations for parametric robust linear optimization problems
- Bianalytic free maps between spectrahedra and spectraballs
- Modeling and estimation of thermal flows based on transport and balance equations
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Scheduling meets n-fold integer programming
- Determinantal sampling designs
- Conic stability of polynomials
- Completely positive reformulations for polynomial optimization
- Region of attraction estimation using invariant sets and rational Lyapunov functions
- Low rank tensor recovery via iterative hard thresholding
- New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry
- On representing the positive semidefinite cone using the second-order cone
- Irreducible infeasible subsystems of semidefinite systems
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- Gap vectors of real projective varieties
- Test sets for nonnegativity of polynomials invariant under a finite reflection group
- Advances in computational Lyapunov analysis using sum-of-squares programming
- Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
- The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
- Plurisubharmonic noncommutative rational functions
- Noncommutative partial convexity via \(\Gamma\)-convexity
- Symmetric non-negative forms and sums of squares
- Reinhardt free spectrahedra
- Geometric control of hybrid systems
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Imaginary projections: complex versus real coefficients
- Matrix convex hulls of free semialgebraic sets
- Exponential varieties
- Sums of squares and varieties of minimal degree
- Lower bounds for polynomials with simplex Newton polytopes based on geometric programming
- Exact algorithms for linear matrix inequalities
- Lower bounds on complexity of Lyapunov functions for switched linear systems
- Algebraic boundaries of convex semi-algebraic sets
- Matrix positivity preservers in fixed dimension. I
- Bad semidefinite programs: they all look the same
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)
