Accelerating convergence of cutting plane algorithms for disjoint bilinear programming

DOI10.1007/s10898-006-9091-3zbMath1171.90494OpenAlexW1970457191MaRDI QIDQ2460141

Faiz A. Al-Khayyal, Xiao-song Ding

Publication date: 14 November 2007

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9091-3

zbMATH Keywords

Linear programmingCutting planeBilinear programmingLower boundingPolar cuts

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items (6)

A review of recent advances in global optimization ⋮ A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent ⋮ An effective global algorithm for worst-case linear optimization under polyhedral uncertainty ⋮ An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming ⋮ Degeneracy removal in cutting plane methods for disjoint bilinear programming ⋮ Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite convergence of algorithms for nonlinear programs and variational inequalities
• Jointly constrained bilinear programs and related problems: An overview
• A note on the solution of bilinear programming problems by reduction to concave minimization
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• A new reformulation-linearization technique for bilinear programming problems
• A linear programming approach to solving bilinear programmes
• Quasi-concave minimization subject to linear constraints
• A framework for analysing decisions under risk
• First-order conditions for isolated locally optimal solutions
• A symmetrical linear maxmin approach to disjoint bilinear programming
• Two-person nonzero-sum games and quadratic programming
• Jointly Constrained Biconvex Programming
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• The bilinear programming problem
• A cutting plane algorithm for solving bilinear programs
• Maximization of A convex quadratic function under linear constraints
• Bilinear programming: An exact algorithm
• A cutting plane algorithm for the bilinear programming problem
• A linear max—min problem
• Optimal Facility Location with Concave Costs
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• Equilibrium Points of Bimatrix Games
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Convex analysis and global optimization
• A simple finite cone covering algorithm for concave minimization
• Concavity cuts for disjoint bilinear programming

This page was built for publication: Accelerating convergence of cutting plane algorithms for disjoint bilinear programming