Local search
From Adaptive Population based Simplex
Revision as of 21:05, 12 June 2013 by MClerc (Talk | contribs) (Created page with "TO COMPLETE == Basic local search (l0) == Define a hypersphere around the best point of the three ones defined in the selection phase.<br /> Radius= maximum distance to the o...")
TO COMPLETE
Basic local search (l0)
Define a hypersphere around the best point of the three ones defined in the selection phase.
Radius= maximum distance to the other vertices of the simplex
The test position is chosen at random in the hypersphere. Random direction (uniform), random radius (uniform), which implies that the distribution is not random (more dense near to the centre)
