Certifying Polynomial Nonnegativity via Hyperbolic Optimization
From MaRDI portal
Publication:5208888
DOI10.1137/19M1253551zbMath1441.14196arXiv1904.00491OpenAlexW2992636988WikidataQ126575966 ScholiaQ126575966MaRDI QIDQ5208888
Publication date: 22 January 2020
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.00491
Semidefinite programming (90C22) Convex programming (90C25) Sums of squares and representations by other particular quadratic forms (11E25) Semialgebraic sets and related spaces (14P10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (7)
Extremal cubics on the circle and the 2-sphere ⋮ Testing hyperbolicity of real polynomials ⋮ Matroids on Eight Elements with the Half-Plane Property and Related Concepts ⋮ Hyperbolicity cones are amenable ⋮ Imaginary projections: complex versus real coefficients ⋮ Definite determinantal representations via orthostochastic matrices ⋮ Semi-definite representations for sets of cubics on the two-dimensional sphere
Cites Work
- Unnamed Item
- Unnamed Item
- A note on the hyperbolicity cone of the specialized Vámos polynomial
- Determinantal representations and the Hermite matrix
- A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs
- Hyperbolicity cones of elementary symmetric polynomials are spectrahedral
- Obstructions to determinantal representability
- Non-representable hyperbolic matroids
- Hyperbolic polynomials, interlacers, and sums of squares
- Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones
- Numerical methods for structured matrices and applications. The Georg Heinig memorial volume
- Semidefinite programming relaxations for semialgebraic problems
- Accelerated first-order methods for hyperbolic programming
- A spectrahedral representation of the first derivative relaxation of the positive semidefinite cone
- Finite free convolutions of polynomials
- Noisy tensor completion via the sum-of-squares hierarchy
- Spectrahedral representations of plane hyperbolic curves
- Spectrahedrality of hyperbolicity cones of multivariate matching polynomials
- Hyperbolic programs, and their derivative relaxations
- Determinantal representations of hyperbolic plane curves: an elementary approach
- Lacunas for hyperbolic differential operators with constant coefficients.I
- Determinantal representations of smooth cubic surfaces
- Global Optimization with Polynomials and the Problem of Moments
- Sums of squares and varieties of minimal degree
- Gårding's Theory of Hyperbolic Polynomials
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- Semidefinite geometry of the numerical range
- Linear matrix inequality representation of sets
- Using Linear Programming to Decode Binary Linear Codes
- The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
- Class of global minimum bounds of polynomial functions
- Hyperbolic Polynomials and Interior Point Methods for Convex Programming
- Sampling Algebraic Varieties for Sum of Squares Programs
- Spectrahedral Shadows
- The Lax conjecture is true
- Semidefinite Optimization and Convex Algebraic Geometry
- Reducibility among Combinatorial Problems
- Maxima for Graphs and a New Proof of a Theorem of Turán
- ``Efficient” Subgradient Methods for General Convex Optimization
- The Euclidean distance degree of an algebraic variety
This page was built for publication: Certifying Polynomial Nonnegativity via Hyperbolic Optimization
