High dimensional optimisation is a challenge for most of the available search methods. Resolving global and constrained task seems to be even harder and exploration of tasks with unknown solutions can be seen very rare in the literature and requires more research efforts. This article analyses optimisation of high dimensional global, including constrained, tasks with unknown solutions. Reviewed and analysed are experimental results precision, possibilities for trapping in local sub-optima and adaptation to unknown search spaces.
Penev, K. (2020). Precision in High Dimensional Optimisation of Global Tasks with Unknown Solutions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11958 LNCS, pp. 524–529). Springer. https://doi.org/10.1007/978-3-030-41032-2_60
Mendeley helps you to discover research relevant for your work.