Corpus ID: 226307095

# Non-local Optimization: Imposing Structure on Optimization Problems by Relaxation

@article{Mller2020NonlocalOI,
title={Non-local Optimization: Imposing Structure on Optimization Problems by Relaxation},
author={Nils M{\"u}ller and T. Glasmachers},
journal={ArXiv},
year={2020},
volume={abs/2011.06064}
}
• Published 2020
• Mathematics, Computer Science
• ArXiv
• In stochastic optimization, particularly in evolutionary computation and reinforcement learning, the optimization of a function $f: \Omega \to \mathbb{R}$ is often addressed through optimizing a so-called relaxation $\theta \in \Theta \mapsto \mathbb{E}_\theta(f)$ of $f$, where $\Theta$ resembles the parameters of a family of probability measures on $\Omega$. We investigate the structure of such relaxations by means of measure theory and Fourier analysis, enabling us to shed light on the… CONTINUE READING

#### References

SHOWING 1-10 OF 16 REFERENCES
Convex Optimization: Algorithms and Complexity
• 843
• PDF
Random Gradient-Free Minimization of Convex Functions
• Mathematics, Computer Science
• Found. Comput. Math.
• 2017
• 392
• PDF
Large Scale Black-Box Optimization by Limited-Memory Matrix Adaptation
• Physics, Computer Science
• IEEE Transactions on Evolutionary Computation
• 2019
• 18
• PDF
Natural Evolution Strategies
• Mathematics, Computer Science
• 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence)
• 2008
• 467
• PDF