Conjugate duality for constrained optimization via image space analysis and abstract convexity
- 49 Downloads
This paper is aimed at establishing a conjugate duality for the constrained optimizations equipped with some topical structures. First, we provide a dual problem for the general constrained optimization, discussing the weak duality as well as the strong duality based on the theory of abstract convexity. Transforming the zero duality gap property into a separation of two sets in image space, we involve the approach inspired by the image space analysis to study the dual theory by the aid of some separation functions. Then, using these results, we investigate this dual frame for the problem with some topical properties.
KeywordsConstrained optimization Conjugate duality Abstract convexity Topical function Image space analysis
This research was partially supported by the National Natural Science Foundation of China (Grants: 11571055 and 11601437 ), the Fundamental Research Funds for the Central Universities (Grant Number: 106112017CD-JZRPY0020) and Scientific and Technological Research Program of Chongqing Municipal Education Commission (Grant Number: KJ1501503).
- 1.Rockafellar, R.T.: Conjugate duality and optimization. In: Society for Industrial and Applied Mathematics (1974)Google Scholar
- 3.Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (2015)Google Scholar
- 7.Gunawardena, J., Keane, M.: On the existence of cycle times for some nonexpansive maps. Technical Report HPL-BRIMS-95-003, Hewlett-Packard Labs (1995)Google Scholar