A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem

DOI10.1007/s10479-017-2407-5zbMath1422.90039OpenAlexW2586013975WikidataQ59520763 ScholiaQ59520763MaRDI QIDQ1657401

Ahmadreza Marandi, Etienne de Klerk, Joachim Dahl

Publication date: 13 August 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/a-numerical-evaluation-of-the-bounded-degree-sumofsquares-hierarchy-of-lasserre-toh-and-yang-on-the-pooling-problem(11dea618-384c-4fe1-89ed-0774354649d7).html

zbMATH Keywords

semidefinite programmingpooling problembilinear optimizationsum-of-squares hierarchy

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26)

Related Items

Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity, Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness, Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, A new approximation hierarchy for polynomial conic optimization, Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods

Uses Software

• APOGEE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A cost minimization heuristic for the pooling problem
• Relaxations and discretizations for the pooling problem
• Global minimization by reducing the duality gap
• Strong formulations for the pooling problem
• Anneaux preordonnes
• Global Optimization with Polynomials and the Problem of Moments
• Analysis of MILP Techniques for the Pooling Problem
• A bilinear approach to the pooling problem†
• Polynomial Programming: LP-Relaxations Also Converge
• The computational complexity of the pooling problem