Adaptive parameterized improving hit-and-run for global optimization

DOI10.1080/10556780903062911MaRDI QIDQ3396387zbMATH OpenOpenAlexFDO

Authors Wei Wang, Archis Ghate, Zelda B. Zabinsky

Publication date 18 September 2009

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780903062911

zbMATH Keywords

adaptive stochastic search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Improving hit-and-run for global optimization
• scientific article; zbMATH DE number 1857677
• Pattern discrete and mixed hit-and-run for global optimization
• Analysis and parameter selection for an adaptive random search algorithm
• Simulation optimization using multi-time-scale adaptive random search

Cited in

(3)

• Hesitant adaptive search for global optimisation
• Improving hit-and-run for global optimization
• Global optimization

Describes a project that uses

Uses Software

• ICOS
• MSNLP

This page was built for publication: Adaptive parameterized improving hit-and-run for global optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3396387)