Constraint Consensus Methods for Finding Interior Feasible Points in Second-Order Cones

Table 7

CQCs: comparison of DBmax method and DBmax method with backtracking.

Problem	DBmax			DBmax with backtracking
	Iter	Time (sec)	Interior feas Pt?	Iter	Time (sec)	Interior feas Pt?
1	25	0.017	N	96	0.110	N
2	11	0.015	N	253	0.601	N
3	21	0.049	N	58	0.231	Y
4	13	0.035	N	500	2.071	N
5	36	0.028	N	45	0.060	Y
6	11	0.042	N	27	0.170	N
7	14	0.060	N	500	3.467	N
8	18	0.057	N	500	2.537	N
9	16	0.026	N	500	1.317	N
10	11	0.044	N	27	0.181	N
11	31	0.054	N	31	0.095	Y
12	13	0.019	N	25	0.061	N
13	12	0.004	N	23	0.012	Y
14	16	0.069	N	500	3.521	N
15	11	0.011	N	21	0.034	Y
16	21	0.005	N	24	0.009	Y
17	15	0.035	N	500	1.895	N
18	14	0.062	N	500	3.572	N
19	23	0.084	N	500	3.083	N
20	27	0.100	N	500	3.049	N
21	28	0.089	N	29	0.199	Y
22	12	0.057	N	500	3.711	N
23	12	0.030	N	27	0.103	Y
24	15	0.002	N	14	0.004	Y
25	13	0.032	N	500	2.001	N