Research Article
Constraint Consensus Methods for Finding Strictly Feasible Points of Linear Matrix Inequalities
| Problem | Dimension () | Numbers of constraints () | Size of matrices () | Source |
| 1 | 2 | 4 | | Random | 2 | 2 | 5 | | Random | 3 | 2 | 10 | | Random | 4 | 3 | 5 | | Random | 5 | 2 | 17 | | Random | 6 | 20 | 25 | | Random | 7 | 20 | 13 | | Random | 8 | 20 | 30 | | Random | 9 | 20 | 40 | | Random | 10 | 10 | 26 | | Random | 11 | 15 | 50 | | Random | 12 | 15 | 100 | | Random | 13 | 7 | 8 | | Random | 14 | 21 | 2 | | control1 [10] | 15 | 66 | 2 | | control2 [10] | 16 | 136 | 2 | | control3 [10] | 17 | 174 | 2 | | arch0 [10] | 18 | 13 | 3 | | hinf01 [10] | 19 | 251 | 1 | 250 | gpp250-1 [10] | 20 | 100 | 1 | 100 | mcp100 [10] | 21 | 124 | 1 | 124 | mcp124-1 [10] | 22 | 250 | 1 | 250 | mcp250-1 [10] | 23 | 10 | 1 | 30 | infd2 [10] | 24 | 101 | 1 | 100 | gpp100 [10] | 25 | 125 | 1 | 124 | gpp124-1 [10] |
|
|