27.06.2013 Views

Evolution and Optimum Seeking

Evolution and Optimum Seeking

Evolution and Optimum Seeking

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

36 Hill climbing Strategies<br />

parabola as the model function (quadratic interpolation). Assuming that the three points<br />

are a (k) < b (k) < c (k) , with the objective function values F (a (k) )F(b (k) ) <strong>and</strong> F (c (k) ),<br />

the trial parabola P (x) hasavanishing rst derivative atthepoint<br />

d (k) = 1<br />

2<br />

[(b (k) ) 2 ; (c (k) ) 2 ] F (a (k) )+[(c (k) ) 2 ; (a (k) ) 2 ] F (b (k) )+[(a (k) ) 2 ; (b (k) ) 2 ] F (c (k) )<br />

[b (k) ; c (k) ] F (a (k) )+[c (k) ; a (k) ] F (b (k) )+[a (k) ; b (k) ] F (c (k) )<br />

(3.16)<br />

This point is a minimum only if the denominator is positive. Otherwise d (k) represents<br />

a maximum or a saddle point. In the case of a minimum, d (k) is introduced as a new<br />

argument value <strong>and</strong> one of the old ones is deleted:<br />

a (k+1) = a (k)<br />

b (k+1) = d (k)<br />

c (k+1) = b (k)<br />

a (k+1) = d (k)<br />

b (k+1) = b (k)<br />

c (k+1) = c (k)<br />

a (k+1) = b (k)<br />

b (k+1) = d (k)<br />

c (k+1) = c (k)<br />

a (k+1) = a (k)<br />

b (k+1) = b (k)<br />

c (k+1) = d (k)<br />

9<br />

>=<br />

><br />

9<br />

>=<br />

><br />

9<br />

>=<br />

><br />

9<br />

>=<br />

><br />

( if a (k)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!