A Linearized Relaxing Algorithm for the Specific Nonlinear Optimization Problem

الملخص EN

We propose a new method for the specific nonlinear and nonconvex global optimization problem by using a linear relaxation technique.

To simplify the specific nonlinear and nonconvex optimization problem, we transform the problem to the lower linear relaxation form, and we solve the linear relaxation optimization problem by the Branch and Bound Algorithm.

Under some reasonable assumptions, the global convergence of the algorithm is certified for the problem.

Numerical results show that this method is more efficient than the previous methods.