Pattern hit-and-run for sampling efficiently on polytopes (Q433826)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pattern hit-and-run for sampling efficiently on polytopes |
scientific article; zbMATH DE number 6053589
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pattern hit-and-run for sampling efficiently on polytopes |
scientific article; zbMATH DE number 6053589 |
Statements
Pattern hit-and-run for sampling efficiently on polytopes (English)
0 references
6 July 2012
0 references
random search algorithms
0 references
global optimization
0 references
simulated annealing
0 references
Markov chain Monte Carlo sampling
0 references
0 references
0 references
0 references
