scientific article; zbMATH DE number 7378399
From MaRDI portal
Publication:5005186
DOI10.4230/LIPIcs.MFCS.2018.82MaRDI QIDQ5005186
Adam Kurpisz, Mareike Dressler, Timo de Wolff
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1802.10004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
sums of squaresnonnegativity certificatesums of nonnegative circuit polynomialshypercube optimizationrelative entropy programming
Related Items (6)
Sublinear circuits for polyhedral sets ⋮ Sublinear circuits and the constrained signomial nonnegativity problem ⋮ Real zeros of SONC polynomials ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ The \(\mathcal{S}\)-cone and a primal-dual view on second-order representability ⋮ A unified framework of SAGE and SONC polynomials and its duality theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Amoebas, nonnegative polynomials and sums of squares supported on circuits
- Relative entropy optimization and its applications
- Forms derived from the arithmetic-geometric inequality
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
- Sum-of-squares hierarchy lower bounds for symmetric formulations
- High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts
- There are significantly more nonnegative polynomials than sums of squares
- Global Optimization with Polynomials and the Problem of Moments
- Convex Relaxations and Integrality Gaps
- Sum-of-squares Lower Bounds for Planted Clique
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
- Class of global minimum bounds of polynomial functions
- On the Shannon capacity of a graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Sum-of-squares proofs and the quest toward optimal algorithms
- Sum of squares lower bounds for refuting any CSP
- MaxMin allocation via degree lower-bounded arborescences
- Robust moment estimation and improved clustering via sum of squares
- Ideals, Varieties, and Algorithms
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- A Positivstellensatz for Sums of Nonnegative Circuit Polynomials
- Computation of the Lasserre Ranks of Some Polytopes
- Rounding Semidefinite Programming Hierarchies via Global Correlation
- Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- How to Sell Hyperedges: The Hypermatching Assignment Problem
- Expander flows, geometric embeddings and graph partitioning
- Complexity of Positivstellensatz proofs for the knapsack
- Complexity of Null- and Positivstellensatz proofs
This page was built for publication:
