Discretization methods for the solution of semi-infinite programming problems
- 1 October 1991
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 71 (1) , 85-103
- https://doi.org/10.1007/bf00940041
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Modifications of the First Remez AlgorithmSIAM Journal on Numerical Analysis, 1990
- A note on the regularization of discrete approximation problemsJournal of Approximation Theory, 1989
- A cutting-plane method for quadratic semi infinite programming problemsOptimization, 1988
- An implementation of a discretization method for semi-infinite programmingMathematical Programming, 1986
- Optimization Theory and ApplicationsPublished by Springer Nature ,1984
- A numerically stable dual method for solving strictly convex quadratic programsMathematical Programming, 1983
- Numerische Methoden der Approximation und semi-infiniten OptimierungPublished by Springer Nature ,1982
- A Multiple Exchange Algorithm for Multivariate Chebyshev ApproximationSIAM Journal on Numerical Analysis, 1975
- Necessary Conditions for a Minimax ApproximationThe Computer Journal, 1966