The Spectrum of the Grigoriev–Laurent Pseudomoments

DOI10.1137/22m1511394zbMath1529.90056arXiv2203.05693MaRDI QIDQ6187076

Moore, Cristopher, Dmitriy Kunisky

Publication date: 10 January 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.05693

zbMATH Keywords

convex optimizationsemidefinite programmingrepresentation theorysum-of-squares

Mathematics Subject Classification ID

Semidefinite programming (90C22) Representations of finite symmetric groups (20C30) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Sums of squares on the hypercube
• Sparse sums of squares on finite abelian groups and improved semidefinite lifts
• Semidefinite programming relaxations for semialgebraic problems
• Homogeneous polynomial solutions to constant coefficient PDE's
• Sum-of-squares hierarchy lower bounds for symmetric formulations
• A tight degree 4 sum-of-squares lower bound for the Sherrington-Kirkpatrick Hamiltonian
• Global Optimization with Polynomials and the Problem of Moments
• Sum-of-squares Lower Bounds for Planted Clique
• On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
• An approach to obtaining global extremums in polynomial mathematical programming problems
• Sum-of-squares proofs and the quest toward optimal algorithms
• A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem
• SOS Is Not Obviously Automatizable, Even Approximately
• Semidefinite Optimization and Convex Algebraic Geometry
• Sum of squares lower bounds for refuting any CSP
• Strongly Regular Graphs
• On the Bit Complexity of Sum-of-Squares Proofs
• Semialgebraic Proofs and Efficient Algorithm Design
• Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
• Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
• Sum-of-squares hierarchies for binary polynomial optimization
• Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
• Complexity of Positivstellensatz proofs for the knapsack
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Spectrum of the Grigoriev–Laurent Pseudomoments