<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=81814"><dc:title>The 100-digit challenge</dc:title><dc:creator>Brest,	Janez	(Avtor)
	</dc:creator><dc:creator>Sepesy Maučec,	Mirjam	(Avtor)
	</dc:creator><dc:creator>Bošković,	Borko	(Avtor)
	</dc:creator><dc:subject>differential evolution</dc:subject><dc:subject>optimization</dc:subject><dc:subject>global optimum</dc:subject><dc:subject>accuracy</dc:subject><dc:description>Real parameter optimization problems are often
very complex and computationally expensive. We can find such
problems in engineering and scientific applications. In this paper,
a new algorithm is proposed to tackle the 100-Digit Challenge.
There are 10 functions representing 10 optimization problems,
and the goal is to compute each function’s minimum value
to 10 digits of accuracy. There is no limit on either time or
the maximum number of function evaluations. The proposed
algorithm is based on the self-adaptive differential evolution
algorithm jDE. Our algorithm uses two populations and some
other mechanisms when tackling the challenge. We provide the
score for each function as required by the organizers of this
challenge competition.</dc:description><dc:date>0</dc:date><dc:date>2022-06-02 15:02:07</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>81814</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
