2 papers
math.OC2024
Outer-space branch-and-bound algorithm for generalized linear multiplicative programs
Bo Zhang
This paper introduces a new global optimization algorithm for solving the generalized linear multiplicative problem (GLMP). The algorithm starts by introducing new variab…
math.OC2023
A New Global Optimization Method Based on Simplex Branching for Solving a Class of Non-Convex QCQP Problems
Bo Zhang, YueLin Gao, Xia Liu +1
Quadratic constrained quadratic programming problems often occur in various fields such as engineering practice, management science, and network communication. This article mainly…