Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions

DOI10.1007/BF01300871zbMath0834.90101OpenAlexW1973711317MaRDI QIDQ1892595

Thai Quynh Phong, Tao Pham Dinh, Le Dung Muu

Publication date: 25 July 1995

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01300871

zbMATH Keywords

bilinear programmingadaptive bisectionconvergent decomposition branch-and-bound algorithms

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (2)

DC programming techniques for solving a class of nonlinear bilevel programs ⋮ Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

Cites Work

• Unnamed Item
• Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
• Constrained global optimization: algorithms and applications
• A parallel algorithm for constrained concave quadratic global minimization
• Relationship between bilinear programming and concave minimization under linear constraints
• Method for minimizing a convex-concave function over a convex set
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• A new reformulation-linearization technique for bilinear programming problems
• Efficient methods for solving certain bilinear programming problems
• Jointly Constrained Biconvex Programming
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Convergent Algorithms for Minimizing a Concave Function
• The bilinear programming problem
• A cutting plane algorithm for solving bilinear programs
• A cutting plane algorithm for the bilinear programming problem
• On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method

This page was built for publication: Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions