References
- Hiriart-Urruty JB. Generalized differentiability, duality and optimization for problems dealing with differences of convex functions Lectures notes in economics and mathematical systems. Vol. 256. Berlin: Springer-Verlag; 1985. p. 37–69.
- Tuy H. Convex analysis and global optimization, Nonconvex optimization and its applications. Vol. 22. Dordrecht: Kluwer Academic Publishers; 1998.
- Ryohei H, Daishi K. Lagrange-type duality in DC programming. J Math Anal Appl. 2014;418(1):415–424. 90C46 (90C26).
- Dinh N, Mordukhovich B, Nghia TTA. Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs. Math Program Ser B. 2010;123(1):101–138.
- Dinh N, Vallet G, Nghia TTA. Farkas-type results and duality for DC programs with convex constraints. J Convex Anal. 2008;15:235–262.
- Horst R, Thoai V. DC programming: overview. J Optim Theory Appl. 1999;103:1–43.
- Jeyakumar V, Lee GM, Linh NTH. Generalized Farkas’ lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization. J Global Optim. 2016;64(4):679–702.
- Le Thi HA, Pham Dinh T, Ngai HV. Exact penalty and error bounds in DC programming. J Global Optim. 2012;52(3):509–535.
- Martinez-Legaz JE, Volle M. Duality in DC programming: the case of several DC constraints. J Math Anal Appl. 1999;237:657–671.
- Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970.
- Zalinescu C. Convex analysis in general vector spaces. Singapore: World Scientific; 2002.
- Dhara A, Dutta J. Optimality conditions in convex optimization. A finite-dimensional view. Boca Raton (FL): CRC Press; 2012.
- Jeyakumar V, Luc DT. Nonsmooth vector functions and continuous optimization. Springer optimization and its applications. Vol. 10. New York (NY): Springer; 2008.
- Penot J-P. Calculus without derivatives. Graduate texts in mathematics. Vol. 266. New York (NY): Springer; 2013.
- Jeyakumar V. Characterizing set containments involving infinite convex constraints and reverse-convex constraints. SIAM J Optim. 2003;13(4):947–959.
- Jeyakumar V, Li G. A new class of alternative theorems for SOS-convex inequalities and robust optimization. Appl Anal. 2015;94(1):56–74.
- Jeyakumar V, Wolkowicz H. Zero duality gaps in infinite-dimensional programming. J Optim Theory Appl. 1990;67:87–108.
- Jeyakumar V, Li GY. Robust solutions of quadratic optimization over single quadratic constraint under interval uncertainty. J Global Optim. 2013;55(2):209–226.
- Ben-Tal A, El Ghaoui L, Nemirovski A. Robust optimization. Princeton series in applied mathematics. Princeton (NJ): Princeton University Press; 2009.