A comparison of some numerical methods for semi-infinite programming
- 5 October 2005
- book chapter
- Published by Springer Nature
- p. 112-125
- https://doi.org/10.1007/bfb0003887
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Linear Chebyshev approximation without Chebyshev setsBIT Numerical Mathematics, 1976
- A newton-method for nonlinear Chebyshev approximationPublished by Springer Nature ,1976
- A Multiple Exchange Algorithm for Multivariate Chebyshev ApproximationSIAM Journal on Numerical Analysis, 1975
- ApproximationstheoriePublished by Springer Nature ,1973
- Ein Konstruktionsverfahren bei allgemeiner linearer ApproximationNumerische Mathematik, 1971
- A method for solving the linear tchebycheff approximation problem when the haar condition is not satisfiedComputing, 1970
- A note on singular minimax approximation problemsJournal of Mathematical Analysis and Applications, 1969
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959