Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
From MaRDI portal
Publication:2176277
DOI10.1007/S10898-019-00844-4zbMATH Open1464.90048OpenAlexW2981881596WikidataQ126990907 ScholiaQ126990907MaRDI QIDQ2176277FDOQ2176277
Authors: Santanu S. Dey, Burak Kocuk, Asteroide Santana 
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
Recommendations
- Strong convex nonlinear relaxations of the pooling problem
- The convex hull of a quadratic constraint over a polytope
- Convex hull presentation of A quadratically constrained set and its application in solving quadratic programming problems
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
Cites Work
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Global optimization with polynomials and the problem of moments
- Explicit convex and concave envelopes through polyhedral subdivisions
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A convex envelope formula for multilinear functions
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- Convex envelopes of monomials of odd degree
- Convex envelopes for edge-concave functions
- A multi-commodity flow formulation for the generalized pooling problem
- Strong formulations for the pooling problem
- Pooling problems with polynomial-time algorithms
- Analysis of MILP techniques for the pooling problem
- A polynomially solvable case of the pooling problem
- The computational complexity of the pooling problem
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- How to convexify the intersection of a second order cone and a nonconvex quadratic
- Analysis of bounds for multilinear functions
- Valid inequalities and convex hulls for multilinear functions
- On nonconvex quadratic programming with box constraints
- Convex analysis and global optimization
- Convexification techniques for linear complementarity constraints
- Global optimization of nonconvex problems with multilinear intermediates
- Relaxations and discretizations for the pooling problem
- New multi-commodity flow formulations for the pooling problem
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Extended formulations for convex hulls of some bilinear functions
- Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
- Error bounds for monomial convexification in polynomial optimization
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- Concave envelopes of monomial functions over rectangles
- A class of valid inequalities for multilinear 0-1 optimization problems
- A polyhedral study of binary polynomial programs
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- The convex hull of a quadratic constraint over a polytope
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Strong convex nonlinear relaxations of the pooling problem
- Facets of a mixed-integer bilinear covering set with bounds on variables
Cited In (8)
- Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity
- The convex hull of a quadratic constraint over a polytope
- On obtaining the convex hull of quadratic inequalities via aggregations
- Cutting plane generation through sparse principal component analysis
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms
- Strong convex nonlinear relaxations of the pooling problem
- Necessary and Sufficient Conditions for Rank-One-Generated Cones
- Convex hull results on quadratic programs with non-intersecting constraints
Uses Software
This page was built for publication: Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176277)
