Journal of Optimization / 2015 / Article / Tab 5

Research Article

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

Table 5

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

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

111.7 0.006 100% 1.2 0.003 99% 0.009
28.0 0.005100% 1.0 0.00297% 0.007
3 11.6 0.013100%0.9 0.003 100% 0.016
4 42.5 0.022100% 1.1 0.002 100% 0.024
5 29.2 0.671100% 2.4 0.090 67% 0.761
620.50.029 100% 1.9 0.00691%0.035
7 45.10.419100% 2.8 0.03662% 0.455
845.30.426100% 2.6 0.035 69% 0.461
927.10.370100%2.6 0.050 75% 0.420
10 25.0 0.123100%2.10.01754% 0.140
1126.00.340100%2.00.03986%0.379
1218.30.057100%1.20.00998%0.0.066
13 32.10.267100%2.70.03164%0.298
14115.30.255100%1.40.005 80%0.260
15285.01.98399%1.60.01886%2.001
16225.53.598100%1.30.03376%3.631
1746.9 1.828100%1.0 0.066100% 1.894
1898.7 0.191100% 1.6 0.005 51% 0.196

Average71.0 1.604 100% 1.9 0.082 79% 1.686