References
- Ekeland I, Temam R. Convex analysis and variational problems. Amsterdam: North-Holland; 1976.
- Wanka G, Boţ RI. On the relations between different dual problems in convex mathematical programming. Heidelberg: Springer-Verlag; 2002. Chamoni P, Leisten R, Martin A, Minnemann J, Stadtler H.
- Boţ RI, Grad S, Wanka G. New regularity conditions for Lagrange and Fenchel--Lagrange duality in infinite dimensional spaces. Math Ineq Appl. 2009;12(1):171–189.
- Boţ RI, Kassay G, Wanka G. Strong duality for general convex optimization problems. J Optim Theory Appl. 2005;127(1):45–70.
- Boţ RI. Conjugate duality in convex optimization. Vol. 637, Lecture notes in economics and mathematical systems. Berlin: Springer-Verlag; 2010.
- Boţ RI, Grad S, Wanka G. Fenchel--Lagrange versus geometric duality in convex optimization. J Optim Theory Appl. 2006;129(1):33–54.
- Scott CH, Jefferson TR. Duality for minmax programs. J Math Anal Appl. 1984;100:385–393.
- Sun XK. Regularity conditions characterizing Fenchel--Lagrange duality and Farkas-type results in DC infinite programming. J Math Anal Appl. 2014;414(2):590–611.
- Sun XK, Li SJ, Zhao D. Duality and Farkas-type results for DC infinite programming with inequality constraints. Taiwanese J Math. 2013;17(4):1227–1244.
- Sun XK, Long XJ, Zeng J. Constraints qualifications characterizing Fenchel duality in composed convex optimization. J Nonlinear Convex Anal. 2016;17(2):325–347.
- Martínez-Legaz JE. Quasiconvex duality theory by generalized conjugation methods. Optimization. 1988;19:603–652.
- Martínez-Legaz JE, Vicente-Pérez J. The e-support function of an e-convex set and conjugacy for e-convex functions. J Math Anal Appl. 2011;376:602–612.
- Rodríguez MML, Vicente-Pérez J. On evenly convex functions. J Convex Anal. 2011;18:721–736.
- Fenchel W. A remark on convex sets and polarity. Comm. S\‘{e}m. Math. Univ. Lund (Medd. Lunds Algebra Univ. Math. Sem.); 1952. p. 82–89. Tome Suppl\’{e}mentaire.
- Goberna MA, Rodríguez MML. Analyzing linear systems containing strict inequalities via evenly convex hulls. Eur J Oper Res. 2006;169:1079–1095.
- Klee V, Maluta E, Zanco C. Basic properties of evenly convex sets. J Convex Anal. 2006;14(1):137–148.
- Fajardo MD, Vicente-Pérez J, Rodríguez MML. Infimal convolution, c-subdifferentiability and Fenchel duality in evenly convex optimization. TOP. 2012;20(2):375–396.
- Fajardo MD, Rodríguez MML, Vidal J. Lagrange duality for evenly convex optimization problems. J Optim Theory Appl. 2016;168(1):109–128.
- Daniilidis A, Martínez-Legaz JE. Characterizations of evenly convex sets and evenly quasiconvex functions. J Math Anal Appl. 2002;273:58–66.
- Goberna MA, Jornet V, Rodríguez MML. On linear systems containing strict inequalities. Linear Algebra Appl. 2003;360:151–171.
- Moreau JJ. Inf-convolution, sous-additivité, convexité des fonctions numériques [Inf-convolution, subadditivity, convexity of numerical functions]. J Math Pures Appl. 1970;49:109–154.
- Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970.
- Zălinescu C. Convex analysis in general vector spaces. Singapore: World Scientific; 2002.
- Gowda MS, Teboulle M. A comparison of constraint qualifications in infinite-dimensional convex programming. SIAM J Control Optim. 1990;28(4):925–935.