Approximation related to quotient functionals (Q968960): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Simon Setzer / rank | |||
Property / author | |||
Property / author: Gabriele Drauschke / rank | |||
Property / author | |||
Property / author: Guido Moerkotte / rank | |||
Revision as of 16:57, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation related to quotient functionals |
scientific article |
Statements
Approximation related to quotient functionals (English)
0 references
11 May 2010
0 references
The best approximation of componentwise positive vectors or positive continuous functions \(f\) is examined by linear combinations \(\hat f = \sum _j \alpha _j \varphi _j\) of given vectors or functions \(\varphi _j\) with respect to functionals \(Q_p, 1\leq p\leq \infty \), involving quotients \(\max\{f/\hat f ,\hat f /f\}\) rather than differences \(|f-\hat f|\). The existence of a best approximating function under mild conditions on \(\{\varphi _j\}_{j=1}^n\) is verified. For discrete data, a best approximating function with respect to \(Q_p\), \(p=1,2,\infty \), is computed by second order cone programming. Special attention is paid to the \(Q_\infty \) functional in both the discrete and the continuous setting. Based on the computation of the subdifferential of our convex functional \(Q_\infty \) an equivalent characterization of the best approximation by using its extremal set is given. Then this characterization is applied to prove the uniqueness of the best \(Q_\infty \) approximation for Chebyshev sets \(\{\varphi _j\}_{j=1}^n\).
0 references
best approximation
0 references
polynomial approximation
0 references
Chebyshev sets
0 references
convex optimization
0 references
second order cone programming
0 references