Abstract
One class of multi-modal optimization approaches that could overcome the curse of dimensionality is random search optimization. However, very little is known about how the parameters of such algorithms should be adjusted in order to achieve a desired convergence speed. In this paper we extend our previous work of developing the probability model for one-parameter systems to two parameter problems when the search domain is a circle. The analysis reveals the key parameters affecting convergence time and provides insight on ways to tune the algorithm for more rapid convergence.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
