Particle Algorithms for Optimization on Binary Spaces

From MaRDI portal
Publication:4635211




Abstract: We discuss a unified approach to stochastic optimization of pseudo-Boolean objective functions based on particle methods, including the cross-entropy method and simulated annealing as special cases. We point out the need for auxiliary sampling distributions, that is parametric families on binary spaces, which are able to reproduce complex dependency structures, and illustrate their usefulness in our numerical experiments. We provide numerical evidence that particle-driven optimization algorithms based on parametric families yield superior results on strongly multi-modal optimization problems while local search heuristics outperform them on easier problems.









This page was built for publication: Particle Algorithms for Optimization on Binary Spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635211)