An accelerating outer space algorithm for globally solving generalized linear multiplicative problems

This paper proposes an accelerating outer space algorithm for globally solving generalized linear multiplicative problems (GLMP). Utilizing the logarithmic and exponential function properties, we begin with transforming the GLMP into an equivalent problem (EP) by introducing some outer space variables. Then, a two-stage outer space relaxation method is developed to convert the EP into a series of relaxed linear problems. Furthermore, to improve the convergence speed of the algorithm, we develop some accelerating techniques to remove the domains that do not contain a global optimal solution. Then, fusing the linear relaxed method and accelerating techniques into the branch-and-bound framework, we provide the accelerating outer space algorithm for solving the EP. Additionally, we analyze the global convergence of the proposed algorithm. Meanwhile, by investigating the algorithmic complexity, we estimate the maximum iterations required by the proposed algorithm in the worst case. Finally, in contrast to other algorithms in the currently known literature, numerical experimental results indicate that the proposed algorithm is feasible with better efficiency and robustness.