Contraction

From Adaptive Population based Simplex
Revision as of 18:54, 28 June 2013 by Editor (Talk | contribs)

Jump to: navigation, search

T== 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 xe 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 CCf(xi)+f(xc)

If xc is better than the best ever found (i.e. Best), set Best=xc.