No label defined (Q5005186)

scientific article; zbMATH DE number 7378399

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7378399

Statements

instance of

0 references

0 references

0 references

0 references

4 August 2021

0 references

full work available at URL

https://arxiv.org/abs/1802.10004

0 references

zbMATH Keywords

nonnegativity certificate

0 references

hypercube optimization

0 references

sums of nonnegative circuit polynomials

0 references

relative entropy programming

0 references

sums of squares

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Expander flows, geometric embeddings and graph partitioning

0 references

Rounding Semidefinite Programming Hierarchies via Global Correlation

0 references

Sum-of-squares proofs and the quest toward optimal algorithms

0 references

Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method

0 references

MaxMin allocation via degree lower-bounded arborescences

0 references

There are significantly more nonnegative polynomials than sums of squares

0 references

Relative entropy optimization and its applications

0 references

Computation of the Lasserre Ranks of Some Polytopes

0 references

Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

0 references

Convex Relaxations and Integrality Gaps

0 references

Ideals, Varieties, and Algorithms

0 references

How to Sell Hyperedges: The Hypermatching Assignment Problem

0 references

Q2934582

0 references

A Positivstellensatz for Sums of Nonnegative Circuit Polynomials

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Complexity of Positivstellensatz proofs for the knapsack

0 references

Q4736859

0 references

Complexity of Null- and Positivstellensatz proofs

0 references

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives

0 references

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors

0 references

Amoebas, nonnegative polynomials and sums of squares supported on circuits

0 references

Robust moment estimation and improved clustering via sum of squares

0 references

Sum of squares lower bounds for refuting any CSP

0 references

Q4507801

0 references

Sum-of-squares hierarchy lower bounds for symmetric formulations

0 references

On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy

0 references

An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem

0 references

Global Optimization with Polynomials and the Problem of Moments

0 references

A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

0 references

Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope

0 references

Q3601990

0 references

Lower Bounds on the Size of Semidefinite Programming Relaxations

0 references

On the Shannon capacity of a graph

0 references

Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy

0 references

High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts

0 references

Sum-of-squares Lower Bounds for Planted Clique

0 references

0 references

0 references

0 references

0 references

Forms derived from the arithmetic-geometric inequality

0 references

Q4496287

0 references

Class of global minimum bounds of polynomial functions

0 references

Q5144633

0 references

Identifiers

DOI

10.4230/LIPIcs.MFCS.2018.82

0 references

Mathematics Subject Classification ID

68Qxx

0 references

zbMATH DE Number

7378399

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5005186