Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
1 answer
125 views

Are there search algorithms that are competitive against (gradient based) optimization routines for continuous problems?

Suppose that $f: \mathbb{R}^n \to \mathbb{R}$ is a continuous function for which we want to minimize. We may arbitrarily impose good conditions for $f$, such as Lipschitzness, smoothness, convexity, ...