On a certain duality for segmented minmax problems
type: Item
instance of: scholarly article
title: On a certain duality for segmented minmax problems
zbMATH Open document ID: 0922.65051
DOI: 10.1007/BF02684408
author: Günter Meinardus
author: Werner Oettli
published in: Computing
publication date: 1999-10-11T00:00:00Z
review text: Minimax problems are considered, where the set of parameters consists of a finite number of knots from a real interval. The segmented approximation by splines with free knots leads to well-known questions, not all of which have been answered satisfactorily up to now. This paper brings new ideas since many such problems can be interpreted as duality problems. A nonstandard duality problem is introduced and the corresponding theory is developed. Several applications and some computational problems are discussed.
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 49J35
zbMATH DE Number: 1220839
zbMATH Keywords: minimax problems
zbMATH Keywords: splines
zbMATH Keywords: duality problems
reviewed by: Viorel Arnăutu
MaRDI profile type: Publication
cites work: Detection of Singularities Using Segment Approximation
cites work: Characteristic properties of the segmented rational minmax approximation problem
cites work: Uniform piecewise polynomial approximation with variable joints
cites work: Q5531436
cites work: Zur Segmentapproximation mit Polynomen
cites work: Some results in segmented approximation
cites work: Algorithms for Piecewise Polynomials and Splines with Free Knots
cites work: An algorithm for segment approximation
cites work: Q5614806
full work available at URL: https://doi.org/10.1007/bf02684408
OpenAlex ID: W2014283079
description: scientific article; zbMATH DE number 1220839