Journal of Optimization / 2015 / Article / Tab 9

Research Article

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

Table 9

Results of the DO, MAP, and MAPCON methods on the 25 test problems.

Problem DOMAPMAPCON
Feas Pt found?Iter Time (sec) Feas Pt found?Iter Time (sec)Feas Pt Found?Iter Time (sec)

1 100% 13.0 0.044 100% 35.0 0.030 40% 7.0 0.016
2 100% 8.5 0.045 100% 76.8 0.068 70% 12.7 0.022
3 100% 12.6 0.073 100% 37.4 0.069100% 45.8 0.108
4 100% 43.5 0.096 100% 91.6 0.108 20% 11.0 0.023
5 100% 15.7 0.110 100% 35.2 0.108100% 79.6 0.308
6 40% 33.8 0.815 0% * >510 0% >510 *
7 70% 46.1 0.621 30% 71.7 3.832 50% 38.2 2.417
8 60% 47.8 1.421 100% 80.6 8.934 0% >510 *
9 60% 30.0 1.214 0% >510 * 60% 149.0 25.418
10 50% 26.8 0.439 0% >510 *100% 67.0 2.173
11 70% 27.3 1.304 0% >510 * 0% >510 *
12 70% 33.1 2.212 0% >510 * 10% 113.0 24.593
13 100% 23.6 0.138100% 45.8 0.264 90% 46.1 0.322
14 80% 108.8 0.803 0% >510 * 0% >510 *
15 100% 261.3 6.676 0% >510 * 0% >510 *
16 80% 207.6 18.719 0% * >500 0% * >500
17 100% 47.2 13.128 0% * >500 0% * >500
18 20% 24.0 0.168 100% 187.6 2.428 0% >510 *
19 60% 128.7 239.697 70% 7.0 168.965 40% 10.0 192.640
20 100% 65.4 3.059 100% 3.0 1.471 100% 3.0 1.538
21 70% 84.4 6.064 100% 3.0 2.644100% 3.0 2.692
22 70% 163.1 84.398 100% 3.0 38.916100% 3.0 38.346
23 80% 91.5 0.517 50% 370.6 4.250 0% >510 *
24 90% 53.9 6.693 100% 25.2 13.662 70% 114.7 63.193
25 70% 68.7 16.433 100% 31.4 39.071 70% 181.9 201.696

Average 77% 56.829.738 58%32.9 22.1 45%43.1 41.742