Please use this identifier to cite or link to this item:https://hdl.handle.net/20.500.12259/43196
Type of publication: Straipsnis kitose duomenų bazėse / Article in other databases (S4)
Field of Science: Informatika / Informatics (N009)
Author(s): Žilinskas, Antanas;Mackutė, Aušra
Title: On Efficiency of Adaptive Search in Optimization over Small Implicitly Defined Feasible Region
Other Title: Adaptyvios optimumo paieškos mažoje neraiškiai apibrėžtoje leistinojoje srityje algoritmų efektyvumas
Is part of: Informacinės technologijos ir valdymas=Information technology and control. Kaunas : Technologija., 2005, T. 34, nr. 2
Extent: p. 153-160
Date: 2005
Keywords: Algorithms efficiency;Experimental investigation;Adaptive search algorithm
Abstract: An optimization problem related to optimal design of processes in oil industry is considered. The problem is difficult because of small, implicitly defined feasible region. In such a case it is difficult not only to construct a rational algorithm for search for minimum, but also to construct an algorithm for search for feasible points. Several algorithms for finding feasible points are proposed as well as several algorithms for optimization in a region approximated using points scattered in the region. A set of test functions is constructed to model the considered industrial optimization problems which normally are not suitable for testing of algorithms because of computational intensity. Testing results are presented, and conclusions about algorithms efficiency are drawn
Internet: http://itc.ktu.lt/
http://itc.ktu.lt/
Affiliation(s): Vytauto Didžiojo universitetas
Appears in Collections:Universiteto mokslo publikacijos / University Research Publications

Files in This Item:
marc.xml8.61 kBXMLView/Open

MARC21 XML metadata

Show full item record
Export via OAI-PMH Interface in XML Formats
Export to Other Non-XML Formats

Page view(s)

138
checked on Jun 1, 2020

Download(s)

12
checked on Jun 1, 2020

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.