The concept of sequential optimality for problems in numerical analysis
type: Item
instance of: scholarly article
title: The concept of sequential optimality for problems in numerical analysis
zbMATH Open document ID: 0637.65049
DOI: 10.1016/0885-064X(87)90020-3
author: Aleksei G. Sukharev
published in: Journal of Complexity
publication date: 1987-01-01T00:00:00Z
review text: The author defines the concept of sequential optimality for the worst- case analysis of approximately solved problems. A class of sequentially optimal algorithms for the numerical integration of monotonic functions is described. Extensions to more general settings are indicated.
Mathematics Subject Classification ID: 65J05
Mathematics Subject Classification ID: 65G50
Mathematics Subject Classification ID: 65D32
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 4039145
zbMATH Keywords: sequential optimality
zbMATH Keywords: worst-case analysis
zbMATH Keywords: sequentially optimal algorithms
zbMATH Keywords: numerical integration of monotonic functions
reviewed by: Gerhard Merz
MaRDI profile type: Publication
cites work: Q3695000
cites work: Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
cites work: Q4082542
cites work: A stochastic algorithm for extremum search, optimal in one step
cites work: A sequentially optimal algorithm for numerical integration
cites work: Q4040646
cites work: Q3883494
description: scientific article; zbMATH DE number 4039145