On a certain duality for segmented minmax problems

DOI10.1007/BF02684408MaRDI QIDQ1271534zbMATH OpenOpenAlexFDO

Authors Günter Meinardus, Werner Oettli

Publication date 11 October 1999

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02684408

zbMATH Keywords

splinesminimax problemsduality problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Existence of solutions for minimax problems (49J35)

Recommendations

• Duality for minmax programs
• scientific article; zbMATH DE number 17929
• Bivariate segment approximation and free knot splines: Research Problems 96-4
• Dual Techniques for Minimax

Cites work

• scientific article; zbMATH DE number 3244284 (Why is no real title available?)
• scientific article; zbMATH DE number 3337849 (Why is no real title available?)
• 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
• Some results in segmented approximation
• Uniform piecewise polynomial approximation with variable joints
• Zur Segmentapproximation mit Polynomen

Cited in

(1)

• scientific article; zbMATH DE number 4013404 (Why is no real title available?)

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)