Accelerating convergence of cutting plane algorithms for disjoint bilinear programming

DOI10.1007/S10898-006-9091-3MaRDI QIDQ2460141zbMATH OpenOpenAlexFDO

Authors Faiz Al-Khayyal, Xiaosong 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

Cutting planeLinear programmingBilinear programmingLower boundingPolar cuts

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(9)

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