A Simple SQP Algorithm for Constrained Finite Minimax Problems

Table 1

Numerical results of Algorithm 1.

Number	𝑛, 𝑚, 𝑚1, 𝑚2	NT	IP	FV
1 ([10, Problem 1])	2, 3, 0, 0	11	(1,5)^𝑇	1.952224
2 ([10, Problem 4])	2, 3, 0, 0	10	(3,1)^𝑇	0.616234
3 ([11, Problem 1])	2, 3, 2, 0	7	(0,0)^𝑇	1.952224
4 ([11, Problem 2])	2, 6, 2, 0	12	(1,3)^𝑇	0.616432
5 ([11, Problem 4])	2, 3, 2, 0	10	(4,2)^𝑇	2.250000
6 ([11, Problem 5])	4, 4, 3, 0	32	(0,1,1,0)^𝑇	−44.000000
7 ([11, Problem 6])	2, 3, 2, 0	4	(0,1)^𝑇	2.000000
8 ([26, Problem 5])	2, 2, 0, 1	12	(0,4)^𝑇	−5.875407
9 ([26, Problem 6])	3, 3, 1, 2	5	(2,3,2)^𝑇	−3.934502
10 ([26, Problem 7])	10, 8, 0, 3	54	(0,1,1,1,0,0,0,1,1,1,0)^𝑇	2.3339𝑒+003