On a certain duality for segmented minmax problems
From MaRDI portal
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.
Recommendations
Cites work
- Algorithms for Piecewise Polynomials and Splines with Free Knots
- An algorithm for segment approximation
- Characteristic properties of the segmented rational minmax approximation problem
- Detection of Singularities Using Segment Approximation
- scientific article; zbMATH DE number 3244284 (Why is no real title available?)
- scientific article; zbMATH DE number 3337849 (Why is no real title available?)
- Some results in segmented approximation
- Uniform piecewise polynomial approximation with variable joints
- Zur Segmentapproximation mit Polynomen
This page was built for publication: On a certain duality for segmented minmax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1271534)
