Possible issues in extreme finding algorithms
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F10%3A63509074" target="_blank" >RIV/70883521:28140/10:63509074 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Possible issues in extreme finding algorithms
Original language description
This paper working with issues, which was created in extreme finding algorithms and function. Paper describing problems which rising during multidimensional function classification. There were more ?simple? functions which are solvable with common searching function. As common finding functions and algorithms there were used function such as climbing algorithms and function based on gradient methods. These methods are usable with function which had one extreme value. In many cases, there were multiple extreme functions which were hard to solve by this algorithms. Single extreme function with dimensions reduced to only 2 (result was in 3D space) is shown on left picture below (founded extreme is highlighted by red point ? starting point is blue).
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of XXXVth. Seminary ASR10 Instruments and Control
ISBN
978-80-248-2191-7
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
—
Publisher name
VŠB-Technická univerzita Ostrava
Place of publication
Ostrava
Event location
Ostrava
Event date
Jan 1, 2010
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—