About convex surface search# Computation - 科学计算
o*y
1 楼
Suppose we have a function F(X) that we can evaluate. X is a vector, and
suppose F() is convex. In this case, what is the best strategy (minimal steps
to find minimal) to find the minimal?
My current naive idea needs 2^n+n+1 times evaluation each step (n is the
dimention of X). I guess this should be a classic problem, I wonder what's
the best strategies known? thanks a lot, bow.
suppose F() is convex. In this case, what is the best strategy (minimal steps
to find minimal) to find the minimal?
My current naive idea needs 2^n+n+1 times evaluation each step (n is the
dimention of X). I guess this should be a classic problem, I wonder what's
the best strategies known? thanks a lot, bow.
