Abstract
In 1951, Fenchel discovered a special duality, which relates the minimization of a sum of two convex functions with the maximization of the sum of concave functions, using conjugates. Fenchel's duality is central to the study of constrained optimization. It requires an existence of an interior point of a convex set which often has empty interior in optimization applications. The well known relaxations of this requirement in the literature are again weaker forms of the interior point condition. Avoiding an interior point condition in duality has so far been a difficult problem. However, a non-interior point type condition is essential for the application of Fenchel's duality to optimization. In this paper we solve this problem by presenting a simple geometric condition in terms of the sum of the epigraphs of conjugate functions. We also establish a necessary and sufficient condition for the ε-subdifferential sum formula in terms of the sum of the epigraphs of conjugate functions. Our results offer further insight into Fenchel's duality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Attouch, H., Brézis, H.: Duality for the sum of convex functions in general Banach spaces. In: J.A. Barroso (ed) Aspects of Mathematics and its applications, North Holland, Amsterdam, pp 125–133, 1986
Brøndsted, A.: Conjugate convex functions in topological vector spaces. Fys. Medd. Dans. Vid. Selsk. 34, 1–26 (1964)
Ekeland, I., Temam, R.: Convex analysis and variational problems. North Holland, Amsterdam, 1976
Fenchel, W.: Convex cones, sets and functions. Lecture Notes, Princeton University, Princeton, 1953
Gowda, M.S., Teboulle, M.: A comparison of constraint qualifications in infinite-dimensional convex programming. SIAM J. Control and Optim. 28 (4), 925–935 (1990)
Hiriart-Urruty, J.-B.:
-subdifferential calculus. In: Convex Analysis and Optimization, Pitman, Boston, pp 43–92, 1982Hiriart-Urruty, J.-B., Phelps, R.R.: Subdifferential Calculus using ε-subdifferentials. J. of Funct. Anal. 118, 154–166 (1993)
Jeyakumar, V.: Duality and infinite dimensional optimization. Nonlinear Anal 15, 1111–1122 (1990)
Jeyakumar, V.: Characterizing set containments involving infinite convex constraints and reverse-convex constraints. SIAM J. Optim. 13, 947–959 (2003)
Jeyakumar, V., Lee, G.M., Dinh, N.: New sequential Lagrange multiplier conditions characterizing optimality without constraint qualifications for convex programs. SIAM J. Optim. 14 (2), 534–547 (2003)
Jeyakumar, V., Wolkowicz, H.: Generalizations of Slater ′s constraint qualification for infinite convex programs. Math. Progr. 57 (1), 85–102 (1992)
Moreau, J.-J.: Fonctionnelles convexes. Collège de France, Lecture Notes, 1967
Moreau, J.-J.: Inf-convolution, sous-additivité, convexité des fonctions numeriques. Journal de Matematiques Pures et Appliquées 49, 109–154 (1970)
Ng, K.F., Song, W.: Fenchel duality in infinite-dimensional setting and its applications. Nonlinear Analysis 25, 845–858 (2003)
Rodrigues, B.: The Fenchel duality Theorem in Fréchet spaces. Optim 21, 13–22 (1990)
Simons, S.: The occasional distributivity of o over + e and the change of variable formula for conjugate functions. Nonlinear Anal 14, 1111–1120 (1990)
Strömberg, T.: The operation of infimal convolution. Diss. Math. 352, 1–61 (1996)
-subdifferential calculus. In: Convex Analysis and Optimization, Pitman, Boston, pp 43–92, 1982Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Terry Rockafellar on his 70th birthday
Rights and permissions
About this article
Cite this article
Burachik, R., Jeyakumar, V. A new geometric condition for Fenchel's duality in infinite dimensional spaces. Math. Program. 104, 229–233 (2005). https://doi.org/10.1007/s10107-005-0614-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-005-0614-3