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.
Recommendations
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- Particle Filtering Framework for a Class of Randomized Optimization Algorithms
- An improved binary particle swarm optimization for discrete optimization problems
- On a practical implementation of particle methods
- Particle methods for statistical inference and design optimization
- Particle methods for stochastic optimal control problems
- The discrete dynamical functional particle method for solving constrained optimization problems
Cited in
(1)
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)