Applications of Dynamical Systems in Search and Optimization
Certain algorithms that are known to converge can be renormalized or "blown up" at each iteration so that their local behavior can be seen. This creates dynamical systems that we can study with modern tools, such as ergodic theory, chaos, special attractors, and Lyapounov exponents. Furthermore, we...
Published August 27th 1999 by Chapman and Hall/CRC