A Novel Self-Adaptive Trust Region Algorithm for Unconstrained Optimization

<table>(a) Step function. (b) <svg height="11.3125" id="M99" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 11.075 11.3125" width="11.075" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.113)"><path d="M627 18l-10 -26q-79 6 -116 27t-69 76q-41 71 -71 138q-13 29 -27.5 39t-42.5 10h-46l-27 -145q-13 -74 -2.5 -88.5t78.5 -20.5l-6 -28h-271l5 28q66 6 82.5 21.5t30.5 87.5l71 387q12 66 2 78.5t-77 19.5l8 28h233q102 0 147 -29q65 -43 65 -129q0 -69 -45.5 -117
t-115.5 -72q40 -86 66 -133q39 -68 65 -101q28 -37 73 -51zM491 483q0 67 -33.5 101t-91.5 34q-35 0 -51 -10q-13 -8 -20 -48l-45 -245h49q71 0 113 28q79 52 79 140z" id="x1D445"></path></g>
</svg>-function <svg height="16.4125" id="M100" style="vertical-align:-3.2316pt" version="1.1" viewbox="0 0 36.612499 16.4125" width="36.612499" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.138)"><path d="M627 18l-10 -26q-79 6 -116 27t-69 76q-41 71 -71 138q-13 29 -27.5 39t-42.5 10h-46l-27 -145q-13 -74 -2.5 -88.5t78.5 -20.5l-6 -28h-271l5 28q66 6 82.5 21.5t30.5 87.5l71 387q12 66 2 78.5t-77 19.5l8 28h233q102 0 147 -29q65 -43 65 -129q0 -69 -45.5 -117
t-115.5 -72q40 -86 66 -133q39 -68 65 -101q28 -37 73 -51zM491 483q0 67 -33.5 101t-91.5 34q-35 0 -51 -10q-13 -8 -20 -48l-45 -245h49q71 0 113 28q79 52 79 140z" id="x1D445"></path></g><g transform="matrix(.017,-0,0,-.017,11.01,12.138)"><path d="M300 -147l-18 -23q-106 71 -159 185.5t-53 254.5v1q0 139 53 252.5t159 186.5l18 -24q-74 -62 -115.5 -173.5t-41.5 -242.5q0 -130 41.5 -242.5t115.5 -174.5z" id="x28"></path></g><g transform="matrix(.017,-0,0,-.017,16.891,12.138)"><path d="M393 379q-9 -16 -28 -29q-15 -10 -23 -2q-19 19 -36 19q-21 0 -52 -38q-57 -72 -82 -126l-40 -197q-23 -3 -75 -18l-7 7q49 196 74 335q7 43 -2 43q-7 0 -30 -14.5t-47 -37.5l-16 23q37 42 82 73t67 31q41 0 15 -113l-11 -50h4q41 71 85 117t77 46q29 0 45 -26
q13 -21 0 -43z" id="x1D45F"></path></g>
<g transform="matrix(.012,-0,0,-.012,24.062,16.212)"><path d="M480 416q0 -21 -18 -41q-9 -11 -17 -7q-20 9 -42 9q-62 0 -140 -78q23 -69 88 -192q17 -31 27 -42t20 -11q16 0 62 46l17 -20q-64 -92 -119 -92q-35 0 -70 66q-41 73 -84 187q-36 -30 -62 -61q-27 -115 -35 -172q-41 -8 -78 -20l-6 6l140 612q7 28 0.5 34t-37.5 7l-34 1
l5 26q38 4 74 13.5t57 17t25 7.5q12 0 4 -32l-104 -443h2q35 38 97 93q39 35 65.5 56t62 41.5t58.5 20.5q19 0 30.5 -10t11.5 -22z" id="x1D458"></path></g>
<g transform="matrix(.017,-0,0,-.017,30.675,12.138)"><path d="M275 270q0 -296 -211 -440l-19 23q75 62 116.5 174t41.5 243t-42 243t-116 173l19 24q211 -144 211 -440z" id="x29"></path></g>
</svg>. (c) <svg height="11.425" id="M101" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 11.7875 11.425" width="11.7875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.363)"><path d="M671 0h-247v28q49 7 60 18.5t0 45.5l-155 438h-2q-21 -61 -74 -204.5t-75 -210.5q-15 -51 -4.5 -65t67.5 -22v-28h-221v28q50 9 69 26.5t45 84.5l202 517l32 9l194 -535q23 -61 42 -78.5t67 -23.5v-28z" id="x39B"></path></g>
</svg>-function <svg height="16.4125" id="M102" style="vertical-align:-3.2316pt" version="1.1" viewbox="0 0 37.325001 16.4125" width="37.325001" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.138)"><path d="M671 0h-247v28q49 7 60 18.5t0 45.5l-155 438h-2q-21 -61 -74 -204.5t-75 -210.5q-15 -51 -4.5 -65t67.5 -22v-28h-221v28q50 9 69 26.5t45 84.5l202 517l32 9l194 -535q23 -61 42 -78.5t67 -23.5v-28z" id="x39B"></path></g><g transform="matrix(.017,-0,0,-.017,11.724,12.138)"><path d="M300 -147l-18 -23q-106 71 -159 185.5t-53 254.5v1q0 139 53 252.5t159 186.5l18 -24q-74 -62 -115.5 -173.5t-41.5 -242.5q0 -130 41.5 -242.5t115.5 -174.5z" id="x28"></path></g><g transform="matrix(.017,-0,0,-.017,17.605,12.138)"><path d="M393 379q-9 -16 -28 -29q-15 -10 -23 -2q-19 19 -36 19q-21 0 -52 -38q-57 -72 -82 -126l-40 -197q-23 -3 -75 -18l-7 7q49 196 74 335q7 43 -2 43q-7 0 -30 -14.5t-47 -37.5l-16 23q37 42 82 73t67 31q41 0 15 -113l-11 -50h4q41 71 85 117t77 46q29 0 45 -26
q13 -21 0 -43z" id="x1D45F"></path></g>
<g transform="matrix(.012,-0,0,-.012,24.775,16.212)"><path d="M480 416q0 -21 -18 -41q-9 -11 -17 -7q-20 9 -42 9q-62 0 -140 -78q23 -69 88 -192q17 -31 27 -42t20 -11q16 0 62 46l17 -20q-64 -92 -119 -92q-35 0 -70 66q-41 73 -84 187q-36 -30 -62 -61q-27 -115 -35 -172q-41 -8 -78 -20l-6 6l140 612q7 28 0.5 34t-37.5 7l-34 1
l5 26q38 4 74 13.5t57 17t25 7.5q12 0 4 -32l-104 -443h2q35 38 97 93q39 35 65.5 56t62 41.5t58.5 20.5q19 0 30.5 -10t11.5 -22z" id="x1D458"></path></g>
<g transform="matrix(.017,-0,0,-.017,31.388,12.138)"><path d="M275 270q0 -296 -211 -440l-19 23q75 62 116.5 174t41.5 243t-42 243t-116 173l19 24q211 -144 211 -440z" id="x29"></path></g>
</svg>.</table>

Journal of Applied Mathematics

fig1

Figure 1

Figure 1: A Novel Self-Adaptive Trust Region Algorithm for Unconstrained Optimization 