scientific article; zbMATH DE number 1258321

MaRDI QIDQ4229145zbMATH OpenFDO

Authors Georg Still

Publication date 9 March 1999

Full work available at URL http://www.emis.de/proceedings/3ICAOC/

zbMATH Keywords

linear semi-infinite optimizationlinear vector-valued approximationstrong and strict best approximation

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15) Numerical mathematical programming methods (65K05) Semi-infinite programming (90C34)

Review text

The author discusses the linear vector-valued approximation problem which can be put in the form of either a convex problem or in the form of a linear semi-infinite optimization problem. It is shown that a comparison of the problems in different norms leads to numerically relevant implications of strongly and strictly uniqueness. A theoretical and numerical comparison of two different approaches for solving the vector-valued approximation problems has been presented. One approach is based on nonlinear optimization the other on the techniques from linear semi-infinite optimization. Finally, genericity questions are considered. For the entire collection see [Zbl 0907.00031].

Cited in

(3)

• Znr yektoriellen linearen tschebyscheff-approximation
• scientific article; zbMATH DE number 1552237 (Why is no real title available?)
• scientific article; zbMATH DE number 2123490 (Why is no real title available?)

This page was built for publication:

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