A disjunctive cutting plane algorithm for bilinear programming
From MaRDI portal
Publication:6622752
DOI10.1137/22m1515562MaRDI QIDQ6622752
Hamed Rahimian, Sanjay Mehrotra
Publication date: 22 October 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Mixed-integer bilinear programming problems
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- A new reformulation-linearization technique for bilinear programming problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Packing equal circles in a square: A deterministic global optimization approach
- A branch-and-cut method for 0-1 mixed convex programming
- Convexification of bilinear forms through non-symmetric lifting
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- Jointly Constrained Biconvex Programming
- Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
- On the Convergence of Sequences of Convex Sets in Finite Dimensions
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A cutting plane algorithm for solving bilinear programs
- A cutting plane algorithm for the bilinear programming problem
- The quickhull algorithm for convex hulls
- The Convex Hull of a Quadratic Constraint over a Polytope
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction
- Convex Analysis
- A disjunctive cutting plane procedure for general mixed-integer linear programs
This page was built for publication: A disjunctive cutting plane algorithm for bilinear programming