Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
From MaRDI portal
Publication:2176277
DOI10.1007/s10898-019-00844-4zbMath1464.90048OpenAlexW2981881596WikidataQ126990907 ScholiaQ126990907MaRDI QIDQ2176277
Asteroide Santana, Santanu S. Dey, Burak Kocuk
Publication date: 4 May 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00844-4
Related Items
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations, Cutting Plane Generation through Sparse Principal Component Analysis, Convex hull results on quadratic programs with non-intersecting constraints, Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms, Strong Convex Nonlinear Relaxations of the Pooling Problem, The Convex Hull of a Quadratic Constraint over a Polytope
Uses Software
Cites Work
- Unnamed Item
- Pooling problems with polynomial-time algorithms
- A polynomially solvable case of the pooling problem
- Relaxations and discretizations for the pooling problem
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- New multi-commodity flow formulations for the pooling problem
- Extended formulations for convex hulls of some bilinear functions
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A convex envelope formula for multilinear functions
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex envelopes of monomials of odd degree
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- A class of valid inequalities for multilinear 0-1 optimization problems
- Convex envelopes for edge-concave functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Global optimization of nonconvex problems with multilinear intermediates
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- A multi-commodity flow formulation for the generalized pooling problem
- Strong formulations for the pooling problem
- Error bounds for monomial convexification in polynomial optimization
- Facets of a mixed-integer bilinear covering set with bounds on variables
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Global Optimization with Polynomials and the Problem of Moments
- Lectures on Modern Convex Optimization
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Convexification Techniques for Linear Complementarity Constraints
- Concave envelopes of monomial functions over rectangles
- Analysis of MILP Techniques for the Pooling Problem
- On Nonconvex Quadratic Programming with Box Constraints
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Strong Convex Nonlinear Relaxations of the Pooling Problem
- The Convex Hull of a Quadratic Constraint over a Polytope
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
- A Polyhedral Study of Binary Polynomial Programs
- Convex analysis and global optimization
- Analysis of bounds for multilinear functions
- The computational complexity of the pooling problem
