Journal of Optimization / 2015 / Article / Tab 4

Research Article

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

Table 4

Results of the OO 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)

120.4 0.008 100% 1.1 0.002 87% 0.010
212.7 0.007100% 1.0 0.003100% 0.010
3 11.0 0.012100%1.0 0.004 100% 0.016
4 46.0 0.024100% 1.4 0.003 100% 0.027
5 192.7 4.276100% 2.6 0.098 64% 4.374
640.10.053 100% 2.1 0.00794%0.060
7 226.52.080100% 2.7 0.03659% 2.116
8224.62.079100% 2.6 0.036 65% 2.115
978.41.167100%3.0 0.059 55% 1.226
10 92.6 0.435100%2.00.01980% 0.454
11116.21.435100%2.60.05272%1.487
1223.80.071100%1.20.098100%0.080
13 124.31.006100%2.80.03472%1.039
14110.50.246100%1.40.007 61%0.253
15265.11.870100%1.30.01567%1.886
16173.72.814100%1.90.04948%2.863
17103.9 3.935100%1.0 0.069100% 4.004
18164.1 0.316100% 1.5 0.005 36% 0.321

Average107.5 2.053 100% 1.9 0.085 75% 2.138