A Modified Three-Term Type CD Conjugate Gradient Algorithm for Unconstrained Optimization Problems

<div>Restoration of the Banoon image, Barbara image, and Lena image by Algorithms <a href="../alg1/">1</a>–3. From left to right: a noisy image with <svg height="8.85534pt" id="M137" style="vertical-align:-0.4673595pt" version="1.1" viewbox="-0.0498162 -8.38798 22.4913 8.85534" width="22.4913pt" 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="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><g transform="matrix(.013,0,0,-0.013,6.24,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"></path></g><g transform="matrix(.013,0,0,-0.013,12.48,0)"><path d="M594 629L561 652L159 -9L190 -32L594 629ZM194 635C92 635 49 534 49 453C49 374 92 272 193 272C295 272 338 374 338 454S295 635 194 635ZM193 605C257 605 265 504 265 453C265 405 257 302 194 302C133 302 122 403 122 454S133 605 193 605ZM567 351C465 351 421 250 421 169C421 90 465 -12 566 -12S710 90 710 170S667 351 567 351ZM566 322C628 322 637 221 637 169C637 121 628 18 567 18S494 119 494 170C494 223 506 322 566 322Z"></path></g></svg> salt-and-pepper noise, the restorations obtained with Algorithms <a href="../alg1/">1</a>–3.</div>

Mathematical Problems in Engineering

fig7

Figure 7

Figure 7: A Modified Three-Term Type CD Conjugate Gradient Algorithm for Unconstrained Optimization Problems 