论文信息 - A comparison of some numerical methods for semi-infinite programming

A comparison of some numerical methods for semi-infinite programming

Three ways to find approximate solutions of semi-infinite programming problems are considered: by discretization, exchange algorithms, and methods we call continuous because they make no use of discretization in the usual sense. Examples as well as theoretical considerations indicate that in general the first two ways only are useful in getting low accuracy approximations to a solution which preferably should be improved by a method of the third type.

R. Hettich

[1] H. Töpfer. Tschebyscheff‐Approximation bei nicht erfüllter Haarscher Bedingung , 1965 .

[2] G. A. Watson,et al. Linear Chebyshev approximation without Chebyshev sets , 1976 .

[3] R. Hettich,et al. On quadratically convergent methods for semi-infinite programming , 1979 .

[4] G. A. Watson,et al. A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation , 1975 .

[5] G. A. Watson,et al. A Note on Singular Minimax Approximation Problems , 1969 .

[6] A. A. Goldstein,et al. Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.

[7] C. Chui,et al. Approximation Theory II , 1976 .

[8] Eugen Schäfer,et al. Ein Konstruktionsverfahren bei allgemeiner linearer Approximation , 1971 .

[9] R. Hettich,et al. A newton-method for nonlinear Chebyshev approximation , 1976 .

[10] H.-J. Töpfer,et al. Tschebyscheff-Approximation und Austauschverfahren bei Nicht Erfüllter Haarscher Bedingung , 1967 .