Abstract
We study infinite dimensional quadratic programming (QP) problems of integral type. The decision variable is taken in the space of bounded regular Borel measures on compact Hausdorff spaces. An implicit cutting plane algorithm is developed to obtain an optimal solution of the infinite dimensional QP problem. The major computational tasks in using the implicit cutting plane approach to solve infinite dimensional QP problems lie in finding a global optimizer of a non-linear and non-convex program. We present an explicit scheme to relax this requirement and to get rid of the unnecessary constraints in each iteration in order to reduce the size of the computatioinal programs. A general convergence proof of this approach is also given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Choquet, G. (1954), Theory of capacities, Annales de l'Institut Fourier 5: 131-295.
Fang, S.C., Lin, C.J. and Wu, S.Y. Relaxations of the cutting plane method for quadratic semiinfinite programming. (submitted).
Fang, S.C. and Puthenpura, S.C. (1993), Linear Optimization and Extensions: Theory and Algorithms, Prentice Hall, Englewood Cliffs, New Jersey.
Fang, S.C., Lin, C.J. and Wu, S.Y. (1994), On solving convex quadratic semi-infinite programming problems, Optimization 31: 107-125.
Fugled, B. (1960), On the theory of potentials in locally compact spaces. Acta Mathematica, 103: 139-215.
Hernandez-Lerma, O. and Lasserre, J.B. (1998), Approximation schemes for infinite linear programs, SIAM Journal on Optimization 8: 973-988.
Hettich, R. and Kortanek, K. (1993), Semi-infinite programming: theory, method and application, SIAM Review 35: 380-429.
Karlin, S. (1959), Mathematical Methods and Theory in Games, Programming and Economics, Pergamon, London.
Lai, H.C. and Wu, S.Y. (1992), Extremal points and optimal solutions for general capacity problems, Mathematical Programming, 54: 87-113.
Luenberger, D.G. (1984), Linear and Nonlinear Programming, Addison-Wesley, Reading, Massachusetts.
Ohtsuka, M. (1966), Generalized capacity and duality theorem in linear programming. Journal of Science, Hiroshima University Series A-I, 30: 45-56.
Ohtsuka, M. (1966), A generalization of duality theorem in the theory of linear programming. Journal of Science, Hiroshima University Series A-I, 30: 31-39.
Reemtsen, R. and Görner, S. (1998), Numerical methods for semi-infinite programming: a survey. In: R. Reemtsen and J-J. Rueckmann (eds), Semi-Infinite Programming, Kluwer Academic Publishers, Boston, pp. 195-275.
Tichatschke, R. and Nebeling, V. (1988), A cutting plane algorithm for solving quadratic semi-infinite programs. Optimization, 19: 803-817.
Wu, S.Y. (1985), Linear programming in measure space. Ph.D. Dissertation, Cambridge University.
Wu, S.Y., (1985), The general capacity problem. In W. Oettli et al. (eds.), Methods of Operations Research, Oelgeschlager, Gunn and Hain.
Yamasaki, M., (1966), On a capacity problem raised in connection with linear programming. Journal of Science, Hiroshima University Series A-I, 30: 57-73.
Yosida, M. (1966), Some examples related to duality theorem in linear programming. Journal of Science, Hiroshima University Series A-I, 30: 41-43.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wu, S. A Cutting Plane Approach to Solving Quadratic Infinite Programs on Measure Spaces. Journal of Global Optimization 21, 67–87 (2001). https://doi.org/10.1023/A:1017954323460
Issue Date:
DOI: https://doi.org/10.1023/A:1017954323460