Abstract
In this paper a brief survey of recent developments in the field of stochastic global optimization methods will be presented. Most methods discussed fall in the category of two-phase algorithms, consisting in a global or exploration phase, obtained through sampling in the feasible domain, and a second or local phase, consisting of refinement of local knowledge, obtained through classical descent routines. A new class of methods is also introduced, characterized by the fact that sampling is performed through deterministic, well distributed, sample points. It is argued that for moderately sized problems this approach might prove more efficient than those based upon uniform random samples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.