A K-means clustering-based multiple importance sampling algorithm for integral global optimization
From MaRDI portal
Publication:2687685
Recommendations
- Cross entropy algorithm with multiple important sample level estimation for global optimization problems
- On importance sampling in the problem of global optimization
- A level-value estimation method and stochastic implementation for global optimization
- A stochastic level-value estimation method for global optimization
- A modified integral global optimization method and its asymptotic convergence
Cites work
- A level-value estimation method and stochastic implementation for global optimization
- A level-value estimation method for solving constrained global optimization
- A level-value estimation method for solving global optimization
- Cross entropy algorithm with multiple important sample level estimation for global optimization problems
- Essential supremum and supremum of summable functions
- Estimation distribution algorithms on constrained optimization problems
- Integral global optimization. Theory, implementation and applications
- Modified integral-level set method for the constrained solving global optimization
- Recent developments and trends in global optimization
- Robust analysis and global optimization
- The cross-entropy method for continuous multi-extremal optimization
This page was built for publication: A K-means clustering-based multiple importance sampling algorithm for integral global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2687685)