Hi community!
To what resolution does the random search algorithm generates new samples? Is it possible to specify a certain resolution to search for a varible?
For example, the independent variable I want to search over, , has the limit of . Is it possible to only search for that is as accurate as the level of 0.01? It reduces the search space to only 200 points.
I assume doing this would make the search converge faster and also, in my application, I do not really care about the $a$ at the decimal of 0.001.
Thank you in advance for your help!
XiaoweiHi community!
To what resolution does the random search algorithm generates new samples? Is it possible to specify a certain resolution to search for a varible?
For example, the independent variable I want to search over, , has the limit of . Is it possible to only search for that is as accurate as the level of 0.01? It reduces the search space to only 200 points.
I assume doing this would make the search converge faster and also, in my application, I do not really care about the $a$ at the decimal of 0.001.
Thank you in advance for your help!
Xiaowei Hi community!
To what resolution does the random search algorithm generates new samples? Is it possible to specify a certain resolution to search for a varible?
For example, the independent variable I want to search over, , has the limit of . Is it possible to only search for that is as accurate as the level of 0.01? It reduces the search space to only 200 points.
I assume doing this would make the search converge faster and also, in my application, I do not really care about the $a$ at the decimal of 0.001.
Thank you in advance for your help!
Xiaowei ga, gamultiobj, genetic algorithm, optimization MATLAB Answers — New Questions

​