We provide a sparse version of the bounded degree SOS hierarchy BSOS (Lasserre et al. in
EURO J Comp Optim: 87–117, 2017) for polynomial optimization problems. It permits to treat …

Designing and analyzing algorithms with provable performance guarantees enables
efficient optimization problem solving in different application domains, eg communication …

The standard pooling problem is a NP-hard subclass of non-convex quadratically-
constrained optimization problems that commonly arises in process systems engineering …

We study sets defined as the intersection of a rank-one constraint with different choices of
linear side constraints. We identify different conditions on the linear side constraints, under …

The pooling problem is an important industrial problem in the class of network flow problems
for allocating gas flow in pipeline transportation networks. For the pooling problem with time …

Quadratically constrained quadratic programs (QCQPs) are ubiquitous in optimization: Such
problems arise in applications from operations research, power systems, signal processing …

The sparse bounded degree sum-of-squares (sparse-BSOS) hierarchy of Weisser et
al.(2017) constructs a sequence of lower bounds for a sparse polynomial optimization …

In this paper we consider polynomial conic optimization problems, where the feasible set is
defined by constraints in the form of given polynomial vectors belonging to given nonempty …

The pooling problem is a classical NP-hard problem in the chemical process and petroleum
industries. This problem is modeled as a nonlinear, nonconvex network flow problem in …

The pooling problem is a frequently studied extension of the traditional minimum cost flow
problem, in which the composition of the flow is subject to restrictions. In a network …