A Transformation of Accelerated Double Step Size Method for Unconstrained Optimization

<table class="table-group" id="tab4"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left">   Average performance </td><td align="center"> TADSS </td><td align="center"> SM </td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left">  Number of iterations </td><td align="center"> 976.21 </td><td align="center"> 24336.82 </td></tr><tr><td align="left">CPU time (in seconds) </td><td align="center"> 4.14 </td><td align="center"> 445.68 </td></tr><tr><td align="left">Number of evaluations </td><td align="center"> 4163.68 </td><td align="center"> 146475.96 </td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Average values of numerical results for the TADSS and the SM methods calculated on <svg height="8.91176pt" id="M226" style="vertical-align:-0.2130003pt" version="1.1" viewbox="-0.0498162 -8.69876 19.6822 8.91176" width="19.6822pt" 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="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" id="g113-51"></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,6.503,0)"><path d="M249 635C141 635 70 555 70 471C70 401 114 353 179 316C143 294 106 267 90 252C68 231 45 202 45 157C45 50 130 -12 237 -12C322 -12 435 52 435 169C435 256 372 304 303 343C349 374 375 398 383 407C401 429 411 458 411 487C411 569 344 635 249 635ZM238 603C285 603 337 567 337 482C337 422 310 385 276 358C205 393 145 426 145 500C145 552 179 603 238 603ZM248 20C183 20 125 70 125 163C125 218 158 268 206 300C284 261 355 217 355 143C355 66 308 20 248 20Z" id="g113-57"></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,13.006,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></svg> tests for each method. 

Mathematical Problems in Engineering

tab4

Table 4

Table 4: A Transformation of Accelerated Double Step Size Method for Unconstrained Optimization 