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

<div>A partition of <svg height="10.424pt" id="M122" style="vertical-align:-0.04990005pt" version="1.1" viewbox="-0.0498162 -10.3741 15.63 10.424" width="15.63pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0136,0,0,-0.0136,0,0)"><path d="M712 0L497 285C582 312 628 378 628 466C628 609 518 662 390 662H70V0H236V271H310L505 0H712ZM491 604C551 577 584 532 584 464C584 401 550 345 491 321V604ZM447 320C428 317 411 315 392 315H236V618H397C412 618 432 613 447 610V320ZM626 44H528L363 271C392 271 422 270 451 275L626 44ZM192 44H114V618H192V44Z" id="g197-29"></path><glyph.data ascent="693" descent="-218" horiz-adv-x="747" vert-adv-y="747"></glyph.data></g><g transform="matrix(.0095,0,0,-0.0095,10.12,-5.984)"><path d="M504 89L488 119C453 85 428 69 416 69C408 69 405 75 412 102L462 304C492 438 460 451 436 451S388 441 356 423C311 397 229 336 170 256H168L189 340C208 418 200 451 177 451C144 451 82 413 24 352L40 322C65 345 98 369 108 369C114 369 119 363 112 335L28 -3L36 -12C54 -3 83 4 112 10C125 73 138 122 153 174C205 258 328 382 376 382C395 382 399 369 384 305L330 93C312 25 323 -12 351 -12C378 -12 439 21 504 89Z" id="g50-111"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="512" vert-adv-y="512"></glyph.data></g></svg> formed by binary words <svg height="12.0395pt" id="M123" style="vertical-align:-2.3616pt" version="1.1" viewbox="-0.0498162 -9.6779 24.1426 12.0395" width="24.1426pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M494 514C482 587 419 712 303 712C238 712 174 667 174 603C174 561 205 514 249 449C219 438 187 422 162 407C93 366 23 283 23 177C23 69 87 -12 190 -12C244 -12 288 5 328 33C406 87 444 170 444 249C444 329 404 391 331 475C265 550 222 605 222 627C222 647 238 657 267 657C355 657 421 585 484 499L494 514ZM359 234C359 143 319 30 219 30C172 30 114 75 114 178C114 275 163 343 195 378C212 397 241 415 269 425C305 382 359 313 359 234Z" id="g113-226"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="517" vert-adv-y="517"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,7.006,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z" id="g113-41"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,11.693,0)"><path d="M536 404C536 423 520 448 491 448C445 448 398 404 308 283L286 338C255 416 242 448 217 448C182 448 138 402 92 341L111 321C149 368 169 378 178 378C188 378 198 363 214 320L254 212C185 117 138 65 107 65C98 65 85 69 82 75C79 82 73 86 65 86C44 86 23 60 23 39C23 7 44 -12 71 -12C119 -12 168 33 265 177L306 61C321 17 347 -12 373 -12C413 -12 465 33 507 96L491 119C459 84 432 60 413 60C395 60 378 92 358 148L321 250C341 279 369 310 389 332C417 363 439 382 456 382C466 382 475 376 481 368C486 361 492 358 496 358C513 358 536 381 536 404Z" id="g113-121"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="559" vert-adv-y="559"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,19.267,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z" id="g113-42"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g></svg>. The feasible region, with <svg height="12.0395pt" id="M124" style="vertical-align:-2.3616pt" version="1.1" viewbox="-0.0498162 -9.6779 62.4191 12.0395" width="62.4191pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M494 514C482 587 419 712 303 712C238 712 174 667 174 603C174 561 205 514 249 449C219 438 187 422 162 407C93 366 23 283 23 177C23 69 87 -12 190 -12C244 -12 288 5 328 33C406 87 444 170 444 249C444 329 404 391 331 475C265 550 222 605 222 627C222 647 238 657 267 657C355 657 421 585 484 499L494 514ZM359 234C359 143 319 30 219 30C172 30 114 75 114 178C114 275 163 343 195 378C212 397 241 415 269 425C305 382 359 313 359 234Z" id="g113-226"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="517" vert-adv-y="517"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,10.791,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z" id="g117-34"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="587" vert-adv-y="587"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,22.528,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z" id="g113-41"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,27.216,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,33.719,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z" id="g113-45"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="228" vert-adv-y="228"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,39.079,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,45.582,0)"><path d="M95 130C70 130 46 113 46 88C46 72 54 64 59 64C93 55 121 33 121 -3C121 -41 93 -68 44 -88L55 -117C117 -98 186 -56 186 22C186 91 131 130 95 130Z" id="g113-45"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="228" vert-adv-y="228"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,50.942,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,57.446,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z" id="g113-42"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g></svg>, is shaded.</div>

Journal of Optimization

fig1

Figure 1

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