Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces

<div>Numerical computational behavior of Algorithm <a href="../alg1/">1:</a>, Algorithm <a href="../alg2/">2:</a>, and Algorithm (4.2) while <span class="nowrap"><svg height="11.6399pt" id="M406" style="vertical-align:-3.29108pt" version="1.1" viewbox="-0.0498162 -8.34882 82.8652 11.6399" width="82.8652pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M484 406C484 429 465 448 438 448C400 448 352 405 302 356L156 213L191 373C195 391 197 404 197 416C197 436 191 448 178 448C151 448 83 406 23 350L37 328C67 350 101 369 109 369C114 369 115 362 111 344L29 -5L34 -12C63 -5 86 -1 111 3C124 73 137 138 147 161C165 180 189 202 206 217C215 194 249 111 275 57C304 -1 319 -12 342 -12C368 -12 405 -5 471 92L454 115C427 80 395 55 384 55C374 55 364 58 341 106L262 274C282 296 367 378 414 378C427 378 440 370 444 367C449 363 454 362 462 368C476 379 484 395 484 406Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,6.266,3.132)"><path d="M245 635C92 635 37 457 37 312C37 149 91 -12 244 -12C395 -12 449 166 449 312C449 469 395 635 245 635ZM243 598C332 598 358 454 358 312C358 173 334 26 245 26C158 26 128 174 128 313S152 598 243 598Z"></path></g><g transform="matrix(.013,0,0,-0.013,14.844,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,26.107,0)"><path d="M484 406C484 429 465 448 438 448C400 448 352 405 302 356L156 213L191 373C195 391 197 404 197 416C197 436 191 448 178 448C151 448 83 406 23 350L37 328C67 350 101 369 109 369C114 369 115 362 111 344L29 -5L34 -12C63 -5 86 -1 111 3C124 73 137 138 147 161C165 180 189 202 206 217C215 194 249 111 275 57C304 -1 319 -12 342 -12C368 -12 405 -5 471 92L454 115C427 80 395 55 384 55C374 55 364 58 341 106L262 274C282 296 367 378 414 378C427 378 440 370 444 367C449 363 454 362 462 368C476 379 484 395 484 406Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,32.373,3.132)"><path d="M389 0V32C297 38 291 46 291 118V635C234 613 175 595 109 583V556L161 554C203 552 207 547 207 497V118C207 46 201 38 110 32V0H389Z"></path></g><g transform="matrix(.013,0,0,-0.013,40.952,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,52.214,0)"><path d="M412 140C382 77 369 73 315 73H129L270 222C362 320 402 379 402 466C402 571 322 635 234 635C177 635 130 609 99 576L42 495L64 475C90 514 133 568 201 568C274 568 318 519 318 435C318 349 255 267 193 193C144 135 87 78 32 23V0H405C417 45 427 89 440 131L412 140Z"></path></g><g transform="matrix(.013,0,0,-0.013,58.454,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z"></path></g><g transform="matrix(.013,0,0,-0.013,65.793,0)"><path d="M535 230V280H323V490H265V280H52V230H265V-3H323V230H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,76.33,0)"><path d="M285 378C315 398 338 416 353 432C373 451 384 474 384 503C384 579 325 635 236 635H235C182 635 136 610 108 579L65 516L85 496C110 533 150 575 205 575C258 575 300 543 300 481C300 407 232 369 141 339L147 310C163 315 188 321 211 321C268 321 338 284 338 192C338 94 288 40 217 40C160 40 119 68 93 91C85 98 77 97 69 91C60 84 47 71 46 58C44 46 48 35 62 22C75 10 116 -12 162 -12C234 -12 424 62 424 224C424 297 373 359 285 376V378Z"></path></g></svg>.</span></div>

Journal of Function Spaces

fig1

Figure 1

Figure 1: Solving a Split Feasibility Problem by the Strong Convergence of Two Projection Algorithms in Hilbert Spaces 