Convexification of bilinear forms through non-symmetric lifting
From MaRDI portal
Publication:2045010
DOI10.1007/S10898-020-00975-ZzbMATH Open1473.90127OpenAlexW3118512612MaRDI QIDQ2045010FDOQ2045010
Authors: Marcia Fampa, Jon Lee 
Publication date: 11 August 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00975-z
Recommendations
- Linearity embedded in nonconvex programs
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Extended formulations for convex hulls of some bilinear functions
Cites Work
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- A note on reduction of quadratic and bilinear programs with equality constraints
- A polytope for a product of real linear functions in 0/1 variables
- Bidimensional Packing by Bilinear Programming
- Bilinear modeling solution approach for fixed charge network flow problems
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- Global optimization of general non-convex problems with intermediate bilinear substructures
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Jointly Constrained Biconvex Programming
- New SOCP relaxation and branching rule for bipartite bilinear programs
- On global optimization with indefinite quadratics
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Polyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopes
- Solving mixed integer bilinear problems using MILP formulations
Cited In (1)
Uses Software
This page was built for publication: Convexification of bilinear forms through non-symmetric lifting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045010)
