Abstract
In this paper, we consider the composed convex optimization problem which consists in minimizing the sum of a convex function and a convex composite function. By using the properties of the epigraph of the conjugate functions and the subdifferentials of convex functions, we give some new constraint qualifications which completely characterize the strong Fenchel duality and the total Fenchel duality for composed convex optimiztion problem in real locally convex Hausdorff topological vector spaces.
Similar content being viewed by others
References
Barbu, V., Precupanu, T. Convexity and Optimization in Banach Spaces. Sijthoff & Noordhoff, Alphen aan den Rijn, The Netherlands, 1978
Boncea, H.V., Grad, S.M. Characterizations of ε-duality gap statements for composed optimization problems. Nonlinear Anal., 92: 96–107 (2013)
Boţ, R.I., Csetnek, E.R., Wanka, G. Regularity conditions via quasi-relative interior in convex programming. SIAM. J. Optim., 19: 217–233 (2008)
Boţ, R.I., Grad, S.M., Wanka, G. A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces. Math. Nachr., 281: 1088–1107 (2008)
Boţ, R.I., Grad, S.M., Wanka, G. Generalized Moreau-Rockafellar results for composed convex functions. Optim., 58: 917–933 (2009)
Boţ, R.I., Grad, S.M., Wanka, G. Duality in Vector Optimizaition. Springer, New York, 2009
Burachik, R.S., Jeyakumar, V., Wu, Z.Y. Necessary and sufficient conditions for stable conjugate duality. Nonlinear Anal., 64: 1998–2006 (2006)
Combari, C., Laghdir, M., Thibault, L. Sous-différentiels de fonctions convexes composées. Ann. Sci. Math. Québec., 18(2): 119–148 (1994)
Dinh, N., Jeyakumar, V., Lee, G.M. Sequential Lagrangian conditions for convex programs with applications to semidefinite programming. J. Optim. Theory Appl., 125: 85–112 (2005)
Dinh, N., Vallet, G., Volle, M. Functional inequalities and theorems of the alternative involving composite functions. J. Glob. Optim., 59: 837–863 (2014)
Fang, D.H., Li, C., Ng, K.F. Constraint qualifications for extended Farkas’s lemmas and Lagrangian dualities in convex infinite programming. SIAM J. Optim., 20(3): 1311–1332 (2009)
Fang, D.H., Li, C., Ng, K.F. Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming. Nonlinear Anal., 73: 1143–1159 (2010)
Fang, D.H., Wang, M.D., Zhao, X.P. The strong duality for DC optimization problems with composite convex functions. J. Nonliear Convex Anal., 16(7): 1337–1352 (2015)
Goberna, M.A., López, M.A. Linear Semi-infinite Optimization. J. Wiley, Chichester, 1998
Li, C., Fang, D.H., López, G., López, M.A. Stable and total Fenchel duality for convex optimization problems in locally convex spaces. SIAM, J. Optim., 20: 1032–1051 (2009)
Li, G., Zhou, Y.Y. The Stable Farkas Lemma for Composite Convex Functions in Infinite Dimensional Spaces. Acta. Math. Appl. Sinica, 31: 677–692 (2015)
Jeyakumar, V. The strong conical hull intersection property for convex programming. Math. Program. Ser. A, 106: 81–92 (2006)
Jeyakumar, V., Dinh, N., Lee, G.M. New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs. SIAM J. Optim., 14: 534–547 (2003)
Rockafellar, R.T. Conjugate duality and optimization, Conference Board of the Mathematical Sciences Regional Conference Series in Applied Mathematics 16, SIAM, Philadelphia, 1974
Rockafellar, R.T., Wets, R.J.B. Variational Analysis. Springer, Heidelberg, 1998
Smirnov, G.S., Smirnov, R.G. Best uniform restricted range approximation of complex-valued functions. C. R. Math. Acad. Sci. Canada, 19: 58–63 (1997)
Smirnov, G.S., Smirnov, R.G. Best uniform approximation of complex-valued functions by generalized polynomialsha ving restricted range. J. Approx. Theory, 100: 284–303 (1999)
Zălinescu, C. Convex Analysis in General Vector Spaces. World Scientific, New Jersey, 2002
Zhou, Y.Y., Li, G. The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions. Numer. Algebra Contr. Optim., 4: 9–23 (2014)
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by the National Natural Science Foundation of China (No. 11461027), Hunan Provincial Natural Science Foundation of China (No. 2016JJ2099) and the Scientific Research Fund of Hunan Provincial Education Department (No.17A172).
Rights and permissions
About this article
Cite this article
Fang, Dh., Wang, Xy. Stable and Total Fenchel Duality for Composed Convex Optimization Problems. Acta Math. Appl. Sin. Engl. Ser. 34, 813–827 (2018). https://doi.org/10.1007/s10255-018-0793-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-018-0793-3