Free Search in Multidimensional Space II

Research output: Chapter in Book/Report/Published conference proceedingChapter

Abstract

Recent publications suggest that resolving multidimensional tasks where optimisation parameters are hundreds and more faces unusual computational limitation. In the same time optimisation algorithms, which perform well on tasks with low number of dimensions, when are applied to high dimensional tasks require infeasible period of time and computational resources. This article presents a novel investigation on Differential Evolution and Particle Swarm Optimisation with enhanced adaptivity and Free Search applied to 200 dimensional versions of three scalable, global, real-value, numerical tests, which optimal values are dependent on dimensions number and virtually unknown for variety of dimensions. The aim is to: (1) identify computational limitations which numerical methods could face on 200 dimensional tests; (2) identify relations between test complexity and period of time required for tests resolving; (3) discover unknown optimal solutions; (4) identify specific methods’ peculiarities which could support the performance on high dimensional tasks. Experimental results are presented and analysed.
Original languageEnglish
Title of host publication Lecture Notes in Computer Science
EditorsIvan Dimov, Stefka Fidanova, Ivan Lirkov
PublisherSpringer International Publishing AG
Pages103-111
Number of pages8
Volume8962
Edition1
ISBN (Electronic)978-3-319-15585-2
ISBN (Print)978-3-319-15584-5
DOIs
Publication statusPublished - 4 Feb 2015
EventNumerical Methods & Applications: International Conference on Numerical Methods and Applications - Borovets, Bulgaria
Duration: 20 Aug 201424 Aug 2014

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Number1
Volume8962
ISSN (Print)0302-9743

Conference

ConferenceNumerical Methods & Applications
Abbreviated titleNMA
CountryBulgaria
CityBorovets
Period20/08/1424/08/14

Fingerprint

Period of time
High-dimensional
Particle swarm optimization (PSO)
Unknown
Optimal Test
Numerical methods
Adaptivity
Parameter Optimization
Differential Evolution
Particle Swarm Optimization
Optimization Algorithm
Optimal Solution
Numerical Methods
Resources
Dependent
Experimental Results

Cite this

Penev, K. (2015). Free Search in Multidimensional Space II. In I. Dimov, S. Fidanova, & I. Lirkov (Eds.), Lecture Notes in Computer Science (1 ed., Vol. 8962, pp. 103-111). (Lecture Notes in Computer Science; Vol. 8962, No. 1). Springer International Publishing AG. https://doi.org/10.1007/978-3-319-15585-2_12
Penev, Kalin. / Free Search in Multidimensional Space II. Lecture Notes in Computer Science. editor / Ivan Dimov ; Stefka Fidanova ; Ivan Lirkov. Vol. 8962 1. ed. Springer International Publishing AG, 2015. pp. 103-111 (Lecture Notes in Computer Science; 1).
@inbook{a8fefbbff3b64608ba8e37d23165194c,
title = "Free Search in Multidimensional Space II",
abstract = "Recent publications suggest that resolving multidimensional tasks where optimisation parameters are hundreds and more faces unusual computational limitation. In the same time optimisation algorithms, which perform well on tasks with low number of dimensions, when are applied to high dimensional tasks require infeasible period of time and computational resources. This article presents a novel investigation on Differential Evolution and Particle Swarm Optimisation with enhanced adaptivity and Free Search applied to 200 dimensional versions of three scalable, global, real-value, numerical tests, which optimal values are dependent on dimensions number and virtually unknown for variety of dimensions. The aim is to: (1) identify computational limitations which numerical methods could face on 200 dimensional tests; (2) identify relations between test complexity and period of time required for tests resolving; (3) discover unknown optimal solutions; (4) identify specific methods’ peculiarities which could support the performance on high dimensional tasks. Experimental results are presented and analysed.",
author = "Kalin Penev",
year = "2015",
month = "2",
day = "4",
doi = "https://doi.org/10.1007/978-3-319-15585-2_12",
language = "English",
isbn = "978-3-319-15584-5",
volume = "8962",
series = "Lecture Notes in Computer Science",
publisher = "Springer International Publishing AG",
number = "1",
pages = "103--111",
editor = "Ivan Dimov and Stefka Fidanova and Ivan Lirkov",
booktitle = "Lecture Notes in Computer Science",
address = "Switzerland",
edition = "1",

}

Penev, K 2015, Free Search in Multidimensional Space II. in I Dimov, S Fidanova & I Lirkov (eds), Lecture Notes in Computer Science. 1 edn, vol. 8962, Lecture Notes in Computer Science, no. 1, vol. 8962, Springer International Publishing AG, pp. 103-111, Numerical Methods & Applications, Borovets, Bulgaria, 20/08/14. https://doi.org/10.1007/978-3-319-15585-2_12

Free Search in Multidimensional Space II. / Penev, Kalin.

Lecture Notes in Computer Science. ed. / Ivan Dimov; Stefka Fidanova; Ivan Lirkov. Vol. 8962 1. ed. Springer International Publishing AG, 2015. p. 103-111 (Lecture Notes in Computer Science; Vol. 8962, No. 1).

Research output: Chapter in Book/Report/Published conference proceedingChapter

TY - CHAP

T1 - Free Search in Multidimensional Space II

AU - Penev, Kalin

PY - 2015/2/4

Y1 - 2015/2/4

N2 - Recent publications suggest that resolving multidimensional tasks where optimisation parameters are hundreds and more faces unusual computational limitation. In the same time optimisation algorithms, which perform well on tasks with low number of dimensions, when are applied to high dimensional tasks require infeasible period of time and computational resources. This article presents a novel investigation on Differential Evolution and Particle Swarm Optimisation with enhanced adaptivity and Free Search applied to 200 dimensional versions of three scalable, global, real-value, numerical tests, which optimal values are dependent on dimensions number and virtually unknown for variety of dimensions. The aim is to: (1) identify computational limitations which numerical methods could face on 200 dimensional tests; (2) identify relations between test complexity and period of time required for tests resolving; (3) discover unknown optimal solutions; (4) identify specific methods’ peculiarities which could support the performance on high dimensional tasks. Experimental results are presented and analysed.

AB - Recent publications suggest that resolving multidimensional tasks where optimisation parameters are hundreds and more faces unusual computational limitation. In the same time optimisation algorithms, which perform well on tasks with low number of dimensions, when are applied to high dimensional tasks require infeasible period of time and computational resources. This article presents a novel investigation on Differential Evolution and Particle Swarm Optimisation with enhanced adaptivity and Free Search applied to 200 dimensional versions of three scalable, global, real-value, numerical tests, which optimal values are dependent on dimensions number and virtually unknown for variety of dimensions. The aim is to: (1) identify computational limitations which numerical methods could face on 200 dimensional tests; (2) identify relations between test complexity and period of time required for tests resolving; (3) discover unknown optimal solutions; (4) identify specific methods’ peculiarities which could support the performance on high dimensional tasks. Experimental results are presented and analysed.

U2 - https://doi.org/10.1007/978-3-319-15585-2_12

DO - https://doi.org/10.1007/978-3-319-15585-2_12

M3 - Chapter

SN - 978-3-319-15584-5

VL - 8962

T3 - Lecture Notes in Computer Science

SP - 103

EP - 111

BT - Lecture Notes in Computer Science

A2 - Dimov, Ivan

A2 - Fidanova, Stefka

A2 - Lirkov, Ivan

PB - Springer International Publishing AG

ER -

Penev K. Free Search in Multidimensional Space II. In Dimov I, Fidanova S, Lirkov I, editors, Lecture Notes in Computer Science. 1 ed. Vol. 8962. Springer International Publishing AG. 2015. p. 103-111. (Lecture Notes in Computer Science; 1). https://doi.org/10.1007/978-3-319-15585-2_12