Sampling the feasible sets of SDPs and volume approximation.
Apostolos ChalkisVissarion FisikopoulosPanagiotis RepouskosElias P. TsigaridasPublished in: ACM Commun. Comput. Algebra (2020)
Keyphrases
- uniform sampling
- error bounds
- random sampling
- sampling strategy
- approximation error
- sampling rate
- monte carlo
- approximation algorithms
- machine learning
- sampling methods
- sampling algorithm
- feasible solution
- sample size
- worst case
- convex sets
- importance sampling
- search engine
- approximation spaces
- continuous functions
- genetic algorithm
- approximation ratio
- adaptive sampling
- data mining
- upper approximation
- hypervolume indicator