Inner Approximation Method for a Reverse Convex Programming Problem
- 105 Downloads
In this paper, we consider a reverse convex programming problem constrained by a convex set and a reverse convex set, which is defined by the complement of the interior of a compact convex set X. We propose an inner approximation method to solve the problem in the case where X is not necessarily a polytope. The algorithm utilizes an inner approximation of X by a sequence of polytopes to generate relaxed problems. It is shown that every accumulation point of the sequence of optimal solutions of the relaxed problems is an optimal solution of the original problem.
Unable to display preview. Download preview PDF.
- 1.Horst, R., and Tuy, H., Global Optimization: Deterministic Approaches, 3rd Edition, Springer Verlag, Berlin, Germany, 1996.Google Scholar
- 2.Horst, R., and Pardalos, P. M., Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht, Netherlands, 1995.Google Scholar
- 3.Konno, H., Thach, P. T., and Tuy, H., Optimization on Low-Rank Nonconvex Structures, Kluwer Academic Publishers, Dordrecht, Netherlands, 1997.Google Scholar
- 4.Tuy, H., Convex Analysis and Global Optimization, Kluwer Academic Publishers, Dordrecht, Netherlands, 1998.Google Scholar
- 5.Rockafellar, R. T., Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.Google Scholar
- 6.Hestenes, M. R., Optimization Theory: The Finite-Dimensional Case, John Wiley, New York, NY, 1975.Google Scholar
- 7.Hogan, W. W., Point-to-Set Maps in Mathematical Programming, SIAM Review, Vol. 15, pp. 591–603, 1973.Google Scholar
- 8.Bazaraa, M. S., Sherali, H. D., and Shetty, C. M., Nonlinear Programming: Theory and Algorithms, 2nd Edition, John Wiley, New York, NY, 1993.Google Scholar