Journal of Optimization / 2015 / Article / Tab 2

Research Article

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

Table 2

Results of the OD method on the test problems.

ProblemPhase 1Phase 2Phase 1 + Phase 2
IterTime (sec)ExitIterTime (sec)Feas Pt found?Total time (sec)

120.4 0.008 100% 1.0 0.002 87% 0.010
212.7 0.007100% 1.0 0.002100% 0.009
3 11.0 0.012100%1.0 0.003 100% 0.015
4 46.0 0.023100% 1.4 0.002 100% 0.026
5 189.8 4.203100% 5.2 0.188 17% 4.391
643.30.056 100% 2.8 0.00846%0.064
7 219.2.11.996100% 5.9 0.07617% 2.072
8219.52.012100% 6.0 0.077 15% 2.089
977.01.000100%5.2 0.094 36% 1.094
10 87.2 0.408100%3.40.02935% 0.437
11113.91.405100%4.00.07746%1.482
1223.80.070100%1.40.010100%0.080
13 122.60.992100%5.40.06119%1.053
14109.60.242100%1.40.005 61%0.247
15266.01.881100%1.20.01469%1.895
16178.32.888100%1.90.04948%2.937
17103.8 3.921100%1.0 0.064100% 3.985
18142.2 0.275100% 1.4 0.005 40% 0.280
19128.318.378100%1.50.431 78%18.809
20 61.9 0.583100%1.80.040100% 0.623
21 81.8 1.021100%4.00.153 66% 1.174
22163.1 6.892100%3.5 0.869 64% 7.761
23108.2 0.209 95%1.2 0.007 73% 0.216
24 53.10.801100%1.40.03765%0.838
25 65.2 1.601100%1.50.07372% 1.674

Average105.9 2.035 100% 2.6 0.095 62% 2.130