Global Optimization and the Geometric Complementarity Problem
We survey briefly recent studies on the relationship between global optimization and the problem of finding a point in the difference of two convex sets (Geometric Complementarity Problem GCP). This relationship is of interest because, for large problem classes, transcending stationarity is equivalent to a special GCP. Moreover, the complementarity viewpoint often leads to dimension reduction techniques which can substantially reduce the computational effort of solving certain special-structured global optimization problems.
KeywordsGlobal Optimization Linear Complementarity Problem Global Optimization Problem Convex Minimization Problem Dimension Reduction Technique
Unable to display preview. Download preview PDF.
- HORST, R. and TUY, H. (1991), ‘The Geometric Complementarity Problem and Transcending Stationarity in Global Optimization’, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 4, Applied Geometry and Discrete Mathematic, The Victor Klee Festschrift, (Gritzmann, P. and Sturmfels, H. (eds.)), 341–345.Google Scholar
- HORST, R. and TUY, H. (1993), Global Optimization, 2nd edition, Springer, Berlin.Google Scholar
- MURTY, K.E. (1988), Linear Complementarity, Linear and Nonlinear Programming Heldermann, Berlin.Google Scholar
- ROCKAFELLAR, R.T. (1970), Convex Analysis, Princeton University Press, Princeton, N.Y.Google Scholar