Algorithms that still produce a solution (maybe not optimal) even when interrupted: Shary's idea justified
type: Item
instance of: scholarly article
title: Algorithms that still produce a solution (maybe not optimal) even when interrupted: Shary's idea justified
zbMATH Open document ID: 0896.65037
DOI: 10.1023/A:1009998515856
author: Maria Beltran
author: Gilbert Castillo
author: Vladik Kreinovich
published in: Reliable Computing
publication date: 1998-09-22T00:00:00Z
review text: Interval algorithms are usually designed to yield an enclosure, i.e. a superset, of the solution set in question (ideally, the narrowest one). This papers deals with algorithms that produce an enclosure of the solution set at any intermediate stage. The idea of such algorithms, ascribed here to \textit{S. P. Shary} [SIAM J. Numer. Anal. 32, No. 2, 610-630 (1995; Zbl 0838.65023)], goes in fact back to mathematical programming (primal methods as opposed to dual ones). The main result of this paper says, roughly speaking, that each interval algorithm can be converted into an interval algorithm possessing the above property such that the computational time still increases only linearly.
Mathematics Subject Classification ID: 65G30
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 1145824
zbMATH Keywords: enclosure
zbMATH Keywords: interval arithmetic
zbMATH Keywords: interval algorithms
zbMATH Keywords: solution set
reviewed by: Jiří Rohn
MaRDI profile type: Publication
full work available at URL: a:1009998515856
OpenAlex ID: W306279013
description: scientific article; zbMATH DE number 1145824