Discretization methods for the solution of semi-infinite programming problems

Journal of Optimization Theory and Applications

Volumn 71, Issue 1, 1991, Pages 85-103

  Reemtsen, R ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Chebyshev approximation; discretization of semi infinite programming problems; Nonlinear programming; semi infinite programming

Indexed keywords

CHEBYSHEV APPROXIMATION; COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - APPROXIMATION THEORY; MATHEMATICAL TECHNIQUES - ITERATIVE METHODS;

DISCRETIZATION METHODS; QUADRATIC PROGRAMMING; SEMI-INFINITE PROGRAMMING;

MATHEMATICAL PROGRAMMING, NONLINEAR;

EID: 0026237216     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/BF00940041     Document Type: Article

References (13)

1. An Implementation of a Discretization Method for Semi-Infinite Programming
2. A Cutting-Plane Method for Quadratic Semi-Infinite Programming Problems
3. Modifications of the First Remez Algorithm
4. A Note on the Regularization of Discrete Approximation Problems
5. Necessary Conditions for a Minimax Approximation
6. A Numerically Stable Dual Method for Solving Strictly Convex Quadratic Programs
7. A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation