Free Search in Multidimensional Space

Research output: Published contribution to conferencePaper

Abstract

One of the challenges for modern search methods is resolving multidimensional tasks where optimization parameters are hundreds, thousands and more. Many evolutionary, swarm and adaptive methods, which perform well on numerical test with up to 10 dimensions are suffering insuperable stagnation when are applied to the same tests extended to 50, 100 and more dimensions. This article presents an original investigation on Free Search, Differential Evolution and Particle Swarm Optimization applied to multidimensional versions of several heterogeneous real-value numerical tests. The aim is to identify how dimensionality reflects on the search space complexity, in particular to evaluate relation between tasks’ dimensions’ number and corresponding iterations’’ number required by used methods for reaching acceptable solution with nonzero probability. Experimental results are presented and analyzed.
Original languageEnglish
Pages289-296
Publication statusPublished - 7 Jul 2013
EventInternational Conference on Large-Scale Scientific Computing -
Duration: 3 Jul 20137 Jul 2013
Conference number: 9th

Conference

ConferenceInternational Conference on Large-Scale Scientific Computing
Period3/07/137/07/13

Fingerprint

Particle swarm optimization (PSO)

Cite this

Penev, K. (2013). Free Search in Multidimensional Space. 289-296. Paper presented at International Conference on Large-Scale Scientific Computing, .
Penev, Kalin. / Free Search in Multidimensional Space. Paper presented at International Conference on Large-Scale Scientific Computing, .
@conference{a9e2faeb16e04d14a832413f4bc63f25,
title = "Free Search in Multidimensional Space",
abstract = "One of the challenges for modern search methods is resolving multidimensional tasks where optimization parameters are hundreds, thousands and more. Many evolutionary, swarm and adaptive methods, which perform well on numerical test with up to 10 dimensions are suffering insuperable stagnation when are applied to the same tests extended to 50, 100 and more dimensions. This article presents an original investigation on Free Search, Differential Evolution and Particle Swarm Optimization applied to multidimensional versions of several heterogeneous real-value numerical tests. The aim is to identify how dimensionality reflects on the search space complexity, in particular to evaluate relation between tasks’ dimensions’ number and corresponding iterations’’ number required by used methods for reaching acceptable solution with nonzero probability. Experimental results are presented and analyzed.",
author = "Kalin Penev",
year = "2013",
month = "7",
day = "7",
language = "English",
pages = "289--296",
note = "International Conference on Large-Scale Scientific Computing ; Conference date: 03-07-2013 Through 07-07-2013",

}

Penev, K 2013, 'Free Search in Multidimensional Space' Paper presented at International Conference on Large-Scale Scientific Computing, 3/07/13 - 7/07/13, pp. 289-296.

Free Search in Multidimensional Space. / Penev, Kalin.

2013. 289-296 Paper presented at International Conference on Large-Scale Scientific Computing, .

Research output: Published contribution to conferencePaper

TY - CONF

T1 - Free Search in Multidimensional Space

AU - Penev, Kalin

PY - 2013/7/7

Y1 - 2013/7/7

N2 - One of the challenges for modern search methods is resolving multidimensional tasks where optimization parameters are hundreds, thousands and more. Many evolutionary, swarm and adaptive methods, which perform well on numerical test with up to 10 dimensions are suffering insuperable stagnation when are applied to the same tests extended to 50, 100 and more dimensions. This article presents an original investigation on Free Search, Differential Evolution and Particle Swarm Optimization applied to multidimensional versions of several heterogeneous real-value numerical tests. The aim is to identify how dimensionality reflects on the search space complexity, in particular to evaluate relation between tasks’ dimensions’ number and corresponding iterations’’ number required by used methods for reaching acceptable solution with nonzero probability. Experimental results are presented and analyzed.

AB - One of the challenges for modern search methods is resolving multidimensional tasks where optimization parameters are hundreds, thousands and more. Many evolutionary, swarm and adaptive methods, which perform well on numerical test with up to 10 dimensions are suffering insuperable stagnation when are applied to the same tests extended to 50, 100 and more dimensions. This article presents an original investigation on Free Search, Differential Evolution and Particle Swarm Optimization applied to multidimensional versions of several heterogeneous real-value numerical tests. The aim is to identify how dimensionality reflects on the search space complexity, in particular to evaluate relation between tasks’ dimensions’ number and corresponding iterations’’ number required by used methods for reaching acceptable solution with nonzero probability. Experimental results are presented and analyzed.

M3 - Paper

SP - 289

EP - 296

ER -

Penev K. Free Search in Multidimensional Space. 2013. Paper presented at International Conference on Large-Scale Scientific Computing, .