Difference between revisions of "Contraction"
From Adaptive Population based Simplex
m |
|||
| Line 2: | Line 2: | ||
We combine four individuals, xbest, xworst2, wworst, and the current xi that has to be moved.<br /> | We combine four individuals, xbest, xworst2, wworst, and the current xi that has to be moved.<br /> | ||
| − | The idea is that the gravity centre of the three first points may be interesting. However, this move is not applied on all dimensions, but only on some of them, according to the probability estimated at the end of the selection phase. So, finally, the formulae to define the new point $ | + | The idea is that the gravity centre of the three first points may be interesting. However, this move is not applied on all dimensions, but only on some of them, according to the probability estimated at the end of the selection phase. So, finally, the formulae to define the new point $x_care,foreachdimensiond$:<br /> |
| − | if rand(0,1)<p) <br /> | + | if (rand(0,1)<p) <br /> |
xc,d=(xbest,d+wworst2,d+wworst,d)/3<br /> | xc,d=(xbest,d+wworst2,d+wworst,d)/3<br /> | ||
else <br /> | else <br /> | ||
Latest revision as of 12:21, 17 October 2013
Basic contraction (c0)
We combine four individuals, xbest, xworst2, wworst, and the current xi that has to be moved.
The idea is that the gravity centre of the three first points may be interesting. However, this move is not applied on all dimensions, but only on some of them, according to the probability estimated at the end of the selection phase. So, finally, the formulae to define the new point xc are, for each dimension d:
if (rand(0,1)<p)
xc,d=(xbest,d+wworst2,d+wworst,d)/3
else
xc,d=xi,d
If xc is better than xi, decrease the population cost C←C−f(xi)+f(xc)
If xc is better than the best ever found (i.e. Best), set Best=xc.
