Agressive methods for solving very-large combinatorial optimization problems
Suppose you need to search over a 100-dimensional hypercube (10^30 nodes) for a node with maximal value, where computing the value of even
a single node is itself a burdensome (and noisy) process. I've been looking into possible ways of doing this:
Cross-entropy optimization
Parallel-tempering & replica-exchange