Sum-of-squares hierarchies for binary polynomial optimization (Q5925640): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-021-01745-9 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-021-01745-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105711037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the cut-norm via Grothendieck's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares proofs and the quest toward optimal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum-of-squares hierarchy on the sphere and applications in quantum information theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse sums of squares on finite abelian groups and improved semidefinite lifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MAX-CUT formulation of 0/1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Look at Nonnegativity on Closed Sets and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite representations for finite varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5343522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Putinar's Positivstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOS Is Not Obviously Automatizable, Even Approximately / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bit Complexity of Sum-of-Squares Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform denominators in Hilbert's seventeenth problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix sum-of-squares relaxations for robust semi-definite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of Schmüdgen's Positivstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3264312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and semidefinite programming methods in combinatorial optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-021-01745-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:13, 19 December 2024

scientific article; zbMATH DE number 7662912
Language Label Description Also known as
English
Sum-of-squares hierarchies for binary polynomial optimization
scientific article; zbMATH DE number 7662912

    Statements

    Sum-of-squares hierarchies for binary polynomial optimization (English)
    0 references
    0 references
    0 references
    14 March 2023
    0 references
    binary polynomial optimization
    0 references
    Lasserre hierarchy
    0 references
    sum-of-squares polynomials
    0 references
    Fourier analysis
    0 references
    Krawtchouk polynomials
    0 references
    polynomial kernels
    0 references
    semidefinite programming
    0 references
    polynomial matrices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers