Journal of Optimization / 2015 / Article / Tab 3

Research Article

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.

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

111.7 0.006 100% 1.1 0.002 99% 0.008
28.0 0.005100% 0.9 0.00298% 0.007
3 11.6 0.013100%0.9 0.003 100% 0.016
4 42.5 0.023100% 1.1 0.002 100% 0.025
5 29.2 0.671100% 2.7 0.099 58% 0.770
620.50.029 100% 2.0 0.00687%0.035
7 44.90.418100% 3.5 0.04544% 0.463
845.50.432100% 3.5 0.049 39% 0.481
927.00.379100%3.4 0.072 63% 0.451
10 25.4 0.126100%2.00.01844% 0.144
1126.00.337100%2.20.04374%0.380
1218.30.057100%1.10.00899%0.065
13 32.30.269100%3.40.03947%0.308
14114.40.253100%1.40.005 80%0.258
15285.01.98499%1.60.01886%2.002
16226.63.613100%1.20.03278%3.645
1746.9 1.786100%1.0 0.073100% 1.859
18102.9 0.197100% 1.9 0.006 47% 0.203

Average71.2 1.603 100% 2.0 0.085 74% 1.688