New SOCP relaxation and branching rule for bipartite bilinear programs
From MaRDI portal
Publication:2331354
DOI10.1007/s11081-018-9402-9zbMath1431.90148arXiv1803.09266OpenAlexW2964069177WikidataQ129205635 ScholiaQ129205635MaRDI QIDQ2331354
Santanu S. Dey, Asteroide Santana, Yang Wang
Publication date: 29 October 2019
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.09266
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (12)
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables ⋮ Shortest Paths in Graphs of Convex Sets ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Convexification of bilinear forms through non-symmetric lifting ⋮ Convex hull representations for bounded products of variables ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm
Uses Software
Cites Work
- Relaxations and discretizations for the pooling problem
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Extended formulations for convex hulls of some bilinear functions
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Linear programs with an additional reverse convex constraint
- A convex envelope formula for multilinear functions
- Deriving convex hulls through lifting and projection
- Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation
- Convex envelopes for edge-concave functions
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Aggregation-based cutting-planes for packing and covering integer programs
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- A branch-and-reduce approach to global optimization
- Some results on the strength of relaxations of multilinear functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Facets of a mixed-integer bilinear covering set with bounds on variables
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Lectures on Modern Convex Optimization
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Convexification Techniques for Linear Complementarity Constraints
- Branching and bounds tighteningtechniques for non-convex MINLP
- Analysis of MILP Techniques for the Pooling Problem
- On Nonconvex Quadratic Programming with Box Constraints
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Jointly Constrained Biconvex Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
- Convex analysis and global optimization
This page was built for publication: New SOCP relaxation and branching rule for bipartite bilinear programs
