Improving storage handling of interval methods for global optimization

Csallner András Erik: Improving storage handling of interval methods for global optimization. In: Acta cybernetica, (13) 4. pp. 413-421. (1998)

[thumbnail of cybernetica_013_numb_004_413-421.pdf]
Cikk, tanulmány, mű

Download (600kB) | Preview


Global nonlinear optimization problems can be solved by interval subdivision methods with guaranteed reliability. These algorithms are based on the branch-and-bound principle and use special storage utilities for the paths not pruned from the search tree yet. In this paper the possibilities for the kinds of applied storage units are discussed. If no ordering is kept in the storage unit then the dependence of the number of operations demanded by the storage on the iterations completed is quadratic in worst case. On the other hand, ordering the elements as it is " necessary for choosing new elements from the storage unit for backtracking, the worst case for the number of storage operations done to the fc-th iteration has the magnitude k log k. The hybrid method defined in this paper satisfies the same complexity properties. It is also proved that the fclogfc magnitude is optimal.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1998
Volume: 13
Number: 4
ISSN: 0324-721X
Page Range: pp. 413-421
Language: English
Place of Publication: Szeged
Related URLs:
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: 421. p. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 13. 15:39

Actions (login required)

View Item View Item