Constraint Consensus Methods for Finding Strictly Feasible Points of Linear Matrix Inequalities

Table 4

Results of the OO method on the test problems with more than one constraint.

Problem	Phase 1			Phase 2			Phase 1 + Phase 2
	Iter	Time (sec)	Exit	Iter	Time (sec)	Feas Pt found?	Total time (sec)
1	20.4	0.008	100%	1.1	0.002	87%	0.010
2	12.7	0.007	100%	1.0	0.003	100%	0.010
3	11.0	0.012	100%	1.0	0.004	100%	0.016
4	46.0	0.024	100%	1.4	0.003	100%	0.027
5	192.7	4.276	100%	2.6	0.098	64%	4.374
6	40.1	0.053	100%	2.1	0.007	94%	0.060
7	226.5	2.080	100%	2.7	0.036	59%	2.116
8	224.6	2.079	100%	2.6	0.036	65%	2.115
9	78.4	1.167	100%	3.0	0.059	55%	1.226
10	92.6	0.435	100%	2.0	0.019	80%	0.454
11	116.2	1.435	100%	2.6	0.052	72%	1.487
12	23.8	0.071	100%	1.2	0.098	100%	0.080
13	124.3	1.006	100%	2.8	0.034	72%	1.039
14	110.5	0.246	100%	1.4	0.007	61%	0.253
15	265.1	1.870	100%	1.3	0.015	67%	1.886
16	173.7	2.814	100%	1.9	0.049	48%	2.863
17	103.9	3.935	100%	1.0	0.069	100%	4.004
18	164.1	0.316	100%	1.5	0.005	36%	0.321
Average	107.5	2.053	100%	1.9	0.085	75%	2.138