# Are questions about No Free Lunch theorem for optimization suitable here?

I have some questions related to No Free Lunch theorem in the setting of optimizing cost functions. I posted it on math.se here and here, but from my experience I have the feeling that few people there know about my questions. So I wonder if questions of this type are suitable here? Or do you have some other suggestions?

Thanks and regards!

Tim, thanks for visiting scicomp! I work in a group that does mixed-integer and non-convex optimization. Although the No Free Lunch Theorem was explained in an informal sense in a non-convex optimization class that I TAed, the typical discussion focused instead on computational complexity. As someone who has done some specialized work in optimization from the computational perspective, I couldn't answer your questions. (Though perhaps one of our other mods, AronAhmadia, might be able to answer them.)
My gut feeling is that questions about the No Free Lunch theorem related to algorithms, such as your first question, are okay. Questions about computational methods and their efficiency are definitely in our scope, although questions on scicomp tend to be less theoretical.