Numerical Methods for Semi-Infinite Programming: A Survey
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 148 references indexed in Scilit:
- Limit analysis with the dual affine scaling algorithmJournal of Computational and Applied Mathematics, 1995
- Iterative processes for solving incorrect convex variational problemsJournal of Global Optimization, 1993
- On Linear Semi-Infinite Programming Problems: An AlgorithmNumerical Functional Analysis and Optimization, 1992
- Discrete approximations of minimization problems. II. ApplicationsNumerical Functional Analysis and Optimization, 1990
- Discrete approximations of minimization problems. I. TheoryNumerical Functional Analysis and Optimization, 1990
- A globally convergent SQP method for semi-infinite nonlinear optimizationJournal of Computational and Applied Mathematics, 1988
- ImplementableL∞penalty-function method for semi-infinite optimizationInternational Journal of Systems Science, 1987
- APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONSMathematics of the USSR-Sbornik, 1969
- On the numerical determination of the best approximations in the Chebyshev senseNumerische Mathematik, 1960
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959