Sum-of-squares certificates for copositivity via test states
From MaRDI portal
Publication:6624426
DOI10.1137/23m1611798MaRDI QIDQ6624426
Luis Felipe Vargas, Markus Schweighofer
Publication date: 25 October 2024
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
semidefinite programmingstable setstability numbercopositive matrixLasserre hierarchysum of squaresgraph polynomialpure statenonnegative polynomialReznick's Positivstellensatztest state
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scaling relationship between the copositive cone and Parrilo's first level approximation
- Optimality conditions and finite convergence of Lasserre's hierarchy
- The extreme rays of the \(5 \times 5\) copositive cone
- Pure states, nonnegative polynomials and sums of squares
- Problème des moments sur un compact de \({\mathbb{R}}^ n\) et décomposition de polynômes a plusieurs variables
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Über die Zerlegung definiter Funktionen in Quadrate.
- Über die Darstellung definiter Formen als Summe von Formenquadraten.
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Uniform denominators in Hilbert's seventeenth problem
- On the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matrices
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Anneaux preordonnes
- There are significantly more nonnegative polynomials than sums of squares
- Sums of squares on real algebraic surfaces
- Approximation of the stability number of a graph via copositive programming
- Positive polynomials and product type actions of compact groups
- Some NP-complete problems in quadratic and nonlinear programming
- Dimension Groups and Their Affine Representations
- On the Shannon capacity of a graph
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Reducibility among Combinatorial Problems
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- A representation theorem for certain partially ordered commutative rings
- C*-Algebras and Mathematical Foundations of Quantum Statistical Mechanics
- Exactness of Parrilo’s Conic Approximations for Copositive Matrices and Associated Low Order Bounds for the Stability Number of a Graph
This page was built for publication: Sum-of-squares certificates for copositivity via test states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624426)