Abstract
We prove that the optimal convergence speed exponent for parallel annealing based on periodically interacting multiple searches with time periodr is always worse than for independent multiple searches whenever the cost function has only one global minimum. Our proofs will be based on large deviation estimates coming from the theory of generalized simulated annealing (G.S.A.).
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.
