Accelerating convergence of cutting plane algorithms for disjoint bilinear programming

DOI10.1007/S10898-006-9091-3zbMATH Open1171.90494OpenAlexW1970457191MaRDI QIDQ2460141FDOQ2460141

Xiaosong Ding, Faiz Al-Khayyal

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

Cutting planeLinear programmingBilinear programmingLower boundingPolar cuts

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

   Recommendations

• Concavity cuts for disjoint bilinear programming 👍 👎
• Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming 👍 👎
• Degeneracy removal in cutting plane methods for disjoint bilinear programming 👍 👎
• A branch-and-cut algorithm for mixed-integer bilinear programming 👍 👎
• A symmetrical linear maxmin approach to disjoint bilinear programming 👍 👎

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

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