Semidefinite Optimization and Convex Algebraic Geometry
From MaRDI portal
Publication:4902572
Cited in
(only showing first 100 items - show all)- Non-unique games over compact groups and orientation estimation in cryo-EM
- Positive semidefinite matrix completion, universal rigidity and the strong Arnold property
- Initial steps in the classification of maximal mediated sets
- Inflation of poorly conditioned zeros of systems of analytic functions
- Spectrahedral shadows
- Tropical spectrahedra
- Optimal bounds on the positivity of a matrix from a few moments
- The tropical analogue of the Helton-Nie conjecture is true
- Families of faces and the normal cycle of a convex semi-algebraic set
- Dimension-free entanglement detection in multipartite Werner states
- Computing symmetric determinantal representations
- Sums of squares in Macaulay2
- The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
- Discriminants of cyclic homogeneous inequalities of three variables
- The saddle point problem of polynomials
- Do sums of squares dream of free resolutions?
- 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
- Alfonso: Matlab Package for Nonsymmetric Conic Optimization
- Eigenconfigurations of tensors
- Matrix convex hulls of free semialgebraic sets
- An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming
- Imaginary projections of polynomials
- Stochastic polynomial optimization
- Lifting for simplicity: concise descriptions of convex sets
- Reducing nonnegativity over general semialgebraic sets to nonnegativity over simple sets
- Approximating nonnegative polynomials via spectral sparsification
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative?
- Hilbert's 17th problem in free skew fields
- A semidefinite hierarchy for containment of spectrahedra
- Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- A Positivstellensatz for sums of nonnegative circuit polynomials
- Livsic-type determinantal representations and hyperbolicity
- 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
- Semidefinite approximations of the matrix logarithm
- Determinantal sampling designs
- B-subdifferential of the projection onto the generalized spectraplex
- Extreme points of matrix convex sets, free spectrahedra, and dilation theory
- A note on convex relaxations for the inverse eigenvalue problem
- Matroids on Eight Elements with the Half-Plane Property and Related Concepts
- Polyhedral approximation of spectrahedral shadows via homogenization
- Lower bounds on complexity of Lyapunov functions for switched linear systems
- Polyhedral approximations of the semidefinite cone and their application
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
- scientific article; zbMATH DE number 7203494 (Why is no real title available?)
- Learning algebraic varieties from samples
- Numerical algebraic geometry and semidefinite programming
- Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- Minimizer Extraction in Polynomial Optimization Is Robust
- Dilations, Linear Matrix Inequalities, the Matrix Cube Problem and Beta Distributions
- Small and strong formulations for unions of convex sets from the Cayley embedding
- Semidefinite Descriptions of the Convex Hull of Rotation Matrices
- 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
- A panorama of positivity. II: Fixed dimension
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Representations of Lie algebras by non-skewselfadjoint operators in Hilbert space
- Scheduling meets n-fold integer programming
- Random points on an algebraic manifold
- Algebraic boundaries of convex semi-algebraic sets
- Semidefinite Representation for Convex Hulls of Real Algebraic Curves
- Sums of squares and varieties of minimal degree
- Positive univariate trace polynomials
- Matrix positivity preservers in fixed dimension. I
- Gap vectors of real projective varieties
- On new classes of nonnegative symmetric tensors
- A complete characterization of determinantal quadratic polynomials
- On the local stability of semidefinite relaxations
- Alternative SDP and SOCP approximations for polynomial optimization
- Orbit spaces of Weyl groups acting on compact tori: a unified and explicit polynomial description
- Exponential varieties
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- A DCA-Newton method for quartic minimization over the sphere
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
- Geometric control of hybrid systems
- On duality gap with polynomial multipliers for polynomial optimization problems
- Sparse moments of univariate step functions and allele frequency spectra
- Differential equations for Gaussian statistical models with rational maximum likelihood estimator
- Symmetric sums of squares over \(k\)-subset hypercubes
- Plurisubharmonic noncommutative rational functions
- Rational dual certificates for weighted sums-of-squares polynomials with boundable bit size
- A Sum of Squares Characterization of Perfect Graphs
- A convex relaxation to compute the nearest structured rank deficient matrix
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- Polyhedral faces in Gram spectrahedra of binary forms
- On domains of noncommutative rational functions
- High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
- Sum-of-squares certificates for Vizing's conjecture via determining Gröbner bases
- Euclidean distance degree of the multiview variety
- Learning Dynamical Systems with Side Information
- A straightforward proof of the polynomial factorization of a positive semi-definite polynomial matrix
- Intersection bodies of polytopes
- Efficient sampling in spectrahedra and volume approximation
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)
