A discrete Chebyshev approximation problem by means of several polynomials

Optimization

Volumn 52, Issue 1, 2003, Pages 29-51

  Demyanov, Alexei V ^a  

^a ST PETERSBURG STATE UNIVERSITY   (Russian Federation)

Author keywords

Chebyshev approximation; Necessary and sufficient optimality conditions; Nonsmooth analysis; Successive approximations

Indexed keywords

EID: 0037298725     PISSN: 02331934     EISSN: None     Source Type: Journal    
DOI: 10.1080/0233193021000015569     Document Type: Article

References (5)

1. Malozemov, V.N. (1969). On finding an algebraic polynomial of best approximation. Kibernetika (In Russian), 5, 125-131.
2. Natanson, I.P. (1964). Constructive function theory. Constructive Function Theory, Vol. 2. Ungar, New York.
3. Remez, E. (1969). Foundations of Numerical Methods of Chebyshev Approximation (In Russian). Kiev, Naukova Dumka.
4. Rockafellar, R.T. (1970). Convex Analysis. Princeton University Press, Princeton, N.J.
5. Vershik, A.M., Malozemov, V.N. and Pevnyi, A.B. (1975). The best piecewise polynomial approximation. Sibirskii Math. Zhurnal, 16(5), 925-938. Engl. Translation in Sib. Math. J., 16(1975), 706-717 (1976).