Method of Chebyshev centers for best linear one-sided \(L_p\)-approximation

Authors

  • I. Maruşciac "Babeş-Bolyai" University, Cluj-Napoca, Romania
Abstract views: 120

Abstract

Not available.

Downloads

Download data is not yet available.

References

Bojanić, R., DeVore, R., On polynomials of best one sided approximation. Enseignement Math. (2) 12 1966 139--164, MR0213790.

DeVore, Ronald, One-sided approximation of functions. J. Approximation Theory 1 1968 no. 1, 11--25, MR0230018.

Levin, A. Ju., An algorithm for minimizing convex functions. (Russian) Dokl. Akad. Nauk SSSR 160 1965 1244--1247, MR0175629.

Maruşciac, I., Preinterpolatory best Lp-approximation generalized polynomials. Studia Univ. Babeş-Bolyai Math. 20 (1975), 60--64, MR0399704.

Rosen, J. B., The gradient projection method for nonlinear programming. I. Linear constraints. J. Soc. Indust. Appl. Math. 8 1960 181--217, MR0112750.

Watson, G. A., The calculation of best linear one-sided Lp approximations. Math. Comp. 27 (1973), 607--620, MR0343537.

Wolfe, Philip, Methods of nonlinear programming. 1963 Recent advances in mathematical programming pp. 67--86 McGraw-Hill, New York, MR0155683.

Zuhovickiĭ, S. I., Primak, M. E., The convergence of the method of Čebyšev centers and of the method of centered sections for the solution of convex programming problems. (Russian) Dokl. Akad. Nauk SSSR 222 (1975), no. 2, 273--276, MR0378814.

Downloads

Published

1977-08-01

How to Cite

Maruşciac, I. (1977). Method of Chebyshev centers for best linear one-sided \(L_p\)-approximation. Anal. Numér. Théor. Approx., 6(2), 145–153. Retrieved from https://ictp.acad.ro/jnaat/journal/article/view/1977-vol6-no2-art6

Issue

Section

Articles