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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Objective function approximations in mathematical programming
• An Extremum Property of Convex Functions

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)