On characterizingL 1-supports, natural and Chebyshev approximates

DOI10.1007/BF02591895zbMath0526.90073MaRDI QIDQ3040933

S. J. Grotzinger

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

uniform approximationconvex hullconjugate functionseparation theoremsL1-approximationsupport hyperplanelinear supportbest approximatesfundamental theorem of max-minlinear approximatenatural criterion

Mathematics Subject Classification ID

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

Related Items (1)

Supports and convex envelopes

Cites Work

• Objective function approximations in mathematical programming
• An Extremum Property of Convex Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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