A Globally Convergent Line Search Filter SQP Method for Inequality Constrained Optimization

Table 4

Comparison of our algorithm with two methods in [18, 23].

No.	The initial point	Method	NIT	NOF	NOG
hs012	(0, 0)	FilterSQP1	5	12	11
		FilterSQP2	7	10	8
		FilterSQP3	8	9	9
hs033	(0, 0, 3)	FilterSQP1	3	4	3
		FilterSQP2	3	4	4
		FilterSQP3	4	5	5
hs043	(0, 0, 0, 0)	FilterSQP1	10	14	13
		FilterSQP2	11	19	12
		FilterSQP3	13	15	14
hs065	(−5, 5, 0)	FilterSQP1	8	12	10
		FilterSQP2	15	11	10
		FilterSQP3	9	10	10
hs076	(0.5, 0.5, 0.5, 0.5)	FilterSQP1	6	7	7
		FilterSQP2	6	7	7
		FilterSQP3	6	7	7
hs113	(2, 3, 5, 5, 1, 2, 7, 3, 6, 10)	FilterSQP1	12	16	15
		FilterSQP2	14	25	15
		FilterSQP3	16	18	17