On characterizingL 1-supports, natural and Chebyshev approximates

DOI10.1007/BF02591895zbMATH Open0526.90073MaRDI QIDQ3040933FDOQ3040933

Authors S. J. Grotzinger

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

convex hullseparation theoremsuniform approximationconjugate functionL1-approximationsupport hyperplanelinear supportbest approximatesfundamental theorem of max-minlinear approximatenatural criterion

Mathematics Subject Classification ID

Convex programming (90C25) Methods of successive quadratic programming type (90C55) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Cites work

• scientific article; zbMATH DE number 3179593 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3484309 (Why is no real title available?)
• scientific article; zbMATH DE number 3562783 (Why is no real title available?)
• scientific article; zbMATH DE number 3637586 (Why is no real title available?)
• scientific article; zbMATH DE number 3247810 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• An Extremum Property of Convex Functions
• Objective function approximations in mathematical programming

Cited in

(1)

• Supports and convex envelopes

This page was built for publication: On characterizingL 1-supports, natural and Chebyshev approximates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3040933)