c# - Minimization of f(x,y) where x and y are integers -


I was wondering if anyone has any suggestions for reducing the function, F (X, Y), where x And y are integers. I've discovered very little amounts and optimization techniques, like outside BFGs and other GSLs, and things beyond numerical recipes. So far, I have tried to implement several different schemes. First task by selecting the direction of the largest number F (X + 1, Y), F (X-1, Y), F (X, Y + 1), F (X, Y-1) and following that direction With line reduction, I have also tried to use a downhill simple (nyled-mead) method, both ways stay far away from a minimum, they work on both simple tasks, such as finding at least paraboloid, but I It seems that both, and especially Pu W, are designed for those tasks where x and y real value (doubles). Another problem is that I have to call F (X, Y) as a while. It talks to external hardware, and takes a few seconds for each call. Any ideas for this will be highly appreciated.

Here is an example of the error function. Sorry, I did not post it before. This function takes a few seconds to evaluate. Also, if we ask the device, then this error is not less than our desired value, only when it is above

  double error (X, Y) {Setwija paras (X, Y ); Double A = Question PARAMA (); Double B = Question B (); Double C = Quercetam (); Duplicate _filter = 0; If (A> = A_desched) {_fReturnable + = (A_Designed-A) * (A_discard-A); } If (b> = b_dicted) {_fReturnable + = (B_desired-b) * (B_desired-b); } If (C> = C_desired) {_fReturnable + = (C_desired-c) * (C_desired-c); } Return mathematics. Sign (_fReturnable)}  

How do you f (x, y) ? Based on the complexity of your function, the minimum problem is a difficult problem.

Resource:

/ div>

Comments

Popular posts from this blog

c# - ListView onScroll event -

PHP - get image from byte array -

Linux Terminal Problem with Non-Canonical Terminal I/O app -