Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- 1 April 2001
- journal article
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 129 (1-2) , 89-104
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Optimization. Algorithms and consistent approximations: Elijah Polak Springer, New York, NY, 1997, ISBN 0-38794971-2, hb., 118 DM, 779 pagesEuropean Journal of Operational Research, 1998
- A primal-dual infeasible-interior-point algorithm for linear semi-infinite programmingComputers & Mathematics with Applications, 1995
- On solving convex quadratic semi-infinite programming probelmsOptimization, 1994
- Semi-Infinite Programming: Theory, Methods, and ApplicationsSIAM Review, 1993
- On the Implementation of a Primal-Dual Interior Point MethodSIAM Journal on Optimization, 1992
- On Linear Semi-Infinite Programming Problems: An AlgorithmNumerical Functional Analysis and Optimization, 1992
- A Fast Algorithm for Linear Complex Chebyshev ApproximationsMathematics of Computation, 1988
- A fast algorithm for linear complex Chebyshev approximationsMathematics of Computation, 1988
- On the Mathematical Foundations of Nondifferentiable Optimization in Engineering DesignSIAM Review, 1987
- Numerical treatment of a class of semi‐infinite programming problemsNaval Research Logistics Quarterly, 1973