A disjunctive cutting plane algorithm for bilinear programming

DOI10.1137/22M1515562MaRDI QIDQ6622752FDOQ6622752

Authors: Hamed Rahimian, Sanjay Mehrotra 

Publication date: 22 October 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

global optimizationnonconvex programmingcutting planesdisjunctive programmingbilinear programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cites Work

• Convex Analysis
• Nonlinear optimization.
• The quickhull algorithm for convex hulls
• A branch-and-cut method for 0-1 mixed convex programming
• Mixed-integer bilinear programming problems
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• A new reformulation-linearization technique for bilinear programming problems
• Disjunctive programming: Properties of the convex hull of feasible points
• Jointly Constrained Biconvex Programming
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
• Title not available (Why is that?)
• Solving mixed integer bilinear problems using MILP formulations
• Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
• Packing equal circles in a square: A deterministic global optimization approach
• A cutting plane algorithm for solving bilinear programs
• A disjunctive cutting plane procedure for general mixed-integer linear programs
• 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
• A cutting plane algorithm for the bilinear programming problem
• Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• The Convex Hull of a Quadratic Constraint over a Polytope
• Convexification of bilinear forms through non-symmetric lifting
• New SOCP relaxation and branching rule for bipartite bilinear programs
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction

This page was built for publication: A disjunctive cutting plane algorithm for bilinear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622752)