On best uniform approximation of finite sets by linear combinations of real valued functions using linear programming

preprint2022arXivOpen access

Abstract

We study the best approximation problem: min⁡α∈Rmmax⁡1≤i≤n∣yi−∑j=1mαjΓj(xi)∣. \displaystyle \min_{α\in \mathbb R^m}\max_{1\leq i\leq n}\left|y_i -\sum_{j=1}^m α_j Γ_j ({\bf x}_i) \right|. Here: Γ:={Γ1,...,Γm}Γ:=\left\{Γ_1,...,Γ_m\right\} is a list of functions where for each 1≤j≤m1\leq j\leq m, Γj:Δ→RΓ_j:Δ\rightarrow \mathbb R with ΔΔ a set of evaluation points {x1,...,xn}\left\{{\bf x_1},...,{\bf x_n}\right\}. {y1,...,yn}\left\{y_1,...,y_n\right\} is a set of real values and Rm:={(α1,...,αm), αj∈R, 1≤j≤m}\mathbb R^m:=\left\{(α_1,...,α_m),\, α_j\in \mathbb R,\, 1\leq j\leq m\right\}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.