scientific article; zbMATH DE number 4061003
The author discusses the discrete optimization problem \[ X\quad *=\arg \min_{x\in X}\kappa (x) \] where X is a discrete set, \(\kappa\) (x): \(X\to R\) 1. He suggests to solve such problems by randomization. For this purpose he considers X as a set of elementary events with a \(\sigma\)- algebra of subsets of the set X and a probabilistic measure P. However, then \(\kappa\) (\(\cdot)\) is a random variable too and there exists the possibility to determine the solution estimation by a sample. The author presents a few algorithms how to do this. Further, it is possible to obtain some estimations of the unknown characteristics of the distribution function of the random variable \(\kappa\) (\(\cdot)\) in this way too.
- Kernel technology to solve discrete optimization problems
- A survey and comparison of discrete and continuous multi-label optimization approaches for the Potts model
- Random optimization on random sets
- About optimization problems with probabilistic uncertainty
- scientific article; zbMATH DE number 6419124 (Why is no real title available?)
- Minimizing the dispersion of centered discrete random variables
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795489)