Abstract
The so called dual parameterization method for quadratic semi-infinite programming (SIP) problems is developed recently. A dual parameterization algorithm is also proposed for numerical solution of such problems. In this paper, we present and improved adaptive algorithm for quadratic SIP problems with positive definite objective and multiple linear infinite constraints. In each iteration of the new algorithm, only a quadratic programming problem with a limited dimension and a limited number of constraints is required to be solved. Furthermore, convergence result is given. The efficiency of the new algorithm is shown by solving a number of numerical examples.
References
Fiacco, A.V. and Ishizuka, Y. (1990), Suggested research topics in sensitivity and stability analysis for semi-infinite programming, Annals Oper. Res., 27, 65–76.
Goberna, M.A. and Lopez, M.A. (1998), Linear Semi-infinite Optimization, John Wiley & Sons, Chichester.
Gustafson, S.-Å. and Kortanek, K.O. (1983), Semi-infinite programming and applications, in Bachen, A. <nt>et al.</nt> <nt>(eds.)</nt>, Mathematical Programming: the State of the Art, Springer-Verlag, Berlin, 138–157.
Hettich, R. (1983), A review of numerical methods for semi-infinite optimization, in Semiinfinite Programming and Applications, Fiacco, A.V. and Kortanek, K.O. <nt>(eds.)</nt>, Springerverlag, Berlin, 158–178.
Hettich, R. and Kortanek, K.O. (1993), Semi-infinite programming: Theory, method, and applications, SIAM Review, 35, 380–429.
Liu, Y., Teo, L. and Ito, S. (1999), A dual parametrization approach to linear-quadratic semiinfinite programming problems, Optimization Methods and Software, 10, 471–491.
Ito, S., Liu, Y. and Teo, K.L. (2000), A dual parametrization method for convex semi-infinite programming, Annals of Operations Research, 98, 189–213.
Liu, Y., Teo, K.L. and Ito, S. (2001), Global optimization in linear-quadratic semi-infinite programming, Computing, Supplement 15, 119–132.
Liu, Y. and Teo, K.L. (2002), An adaptive dual parameterization algorithm for quadratic semi-infinite programming problems, Journal of Global Optimization, 24, 205–217.
Luenberger, D.G. (1969), Optimization by Vector Space Method, John Wiley & Sons Inc., New York-London-Sydney-Toronto.
Soon-Yi Wu and Fang, S.-C. (1999), Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method, in Computers and Mathematics with Applications, Vol. 38.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liu, Y., Teo, K. & Wu, S. A New Quadratic Semi-infinite Programming Algorithm Based on Dual Parametrization. Journal of Global Optimization 29, 401–413 (2004). https://doi.org/10.1023/B:JOGO.0000047910.80739.95
Issue Date:
DOI: https://doi.org/10.1023/B:JOGO.0000047910.80739.95