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

Table 3

Results of the DD 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	11.7	0.006	100%	1.1	0.002	99%	0.008
2	8.0	0.005	100%	0.9	0.002	98%	0.007
3	11.6	0.013	100%	0.9	0.003	100%	0.016
4	42.5	0.023	100%	1.1	0.002	100%	0.025
5	29.2	0.671	100%	2.7	0.099	58%	0.770
6	20.5	0.029	100%	2.0	0.006	87%	0.035
7	44.9	0.418	100%	3.5	0.045	44%	0.463
8	45.5	0.432	100%	3.5	0.049	39%	0.481
9	27.0	0.379	100%	3.4	0.072	63%	0.451
10	25.4	0.126	100%	2.0	0.018	44%	0.144
11	26.0	0.337	100%	2.2	0.043	74%	0.380
12	18.3	0.057	100%	1.1	0.008	99%	0.065
13	32.3	0.269	100%	3.4	0.039	47%	0.308
14	114.4	0.253	100%	1.4	0.005	80%	0.258
15	285.0	1.984	99%	1.6	0.018	86%	2.002
16	226.6	3.613	100%	1.2	0.032	78%	3.645
17	46.9	1.786	100%	1.0	0.073	100%	1.859
18	102.9	0.197	100%	1.9	0.006	47%	0.203
Average	71.2	1.603	100%	2.0	0.085	74%	1.688