A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems

Table 1

Computational results of Examples 1–5.

Example	Methods	Optimal solution	Optimal value	Iter.	𝐿max
Example 1	[13]	(0, 0, 1.25)	2.9311923	25
	Ours	(0, 0, 1.25)	2.9311923	15	4
Example 2	[13]	(0.000, 1.111, 0.000)	4.217	31
	Ours	(0.000, 1.111, 0.000)	4.217	20	5
Example 3	[14]	(1.5, 1.5, 0)	7.96324	52	3
	Ours	(3.0, 4.0, 0)	5.7606445	55	8
Example 4	[11]	(1.0, 1.0)	1.3463824	26	4
	[12]	(1.0, 1.0)	1.3463824	1	0
	Ours	(1.0, 1.0)	1.3463824	24	2
Example 5	[11]	(1.0, 1.0)	288.0	43	5
	[12]	(1.0, 1.0)	288.0	1	0
	Ours	(1.0, 1.0)	288.0	42	5