References
- Jeyakumar V. Farkas lemma: generalizations, encylopedia of optimization. Vol. 2. USA: Kluwer Boston; 2000. p. 87–91.
- Jeyakumar V, Lee GM, Li GY. Alternative theorems for quadratic inequality systems and global quadratic optimization. SIAM J. Optim. 2009;20:983–1001.
- Jeyakumar V, Huy NQ, Li GY. Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization. Optim. and Eng. 2009;10:491–503.
- Jeyakumar V, Li G, Lee GM. A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty. Oper. Res. Lett. 2011;39:109–114.
- Jeyakumar V, Li G. Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. 2012;40:529–536.
- Ben-Tal A, El Ghaoui L, Nemirovski A. Robust optimization. Princeton Series in Applied Mathematics; Princeton, NJ: Princeton University Press; 2009.
- Jeyakumar V, Li G. Necessary global optimality conditions for nonlinear programming problems with polynomial constraints. Math. Program. 2011;126:393–399.
- Laurent M. Sums of squares, moment matrices and optimization over polynomials. Emerging applications of algebraic geometry. In: Putinar M, Sullivant S, editors. IMA Volumes in mathematics and its applications. Vol. 149. New York, NY: Springer; 2009. p. 157–270.
- Ahmadi AA, Parrilo PA. A convex polynomial that is not SOS-convex. Math. Program. 2012;135:275–292.
- Helton JW, Nie JW. Semidefinite representation of convex sets. Math. Program Ser. A. 2010;122:21–64.
- Ahmadi AA, Parrilo PA. A complete characterization of the gap between convexity and SOS-convexity. SIAM J. Optim. 2013;23:811–833.
- Belousov EG, Klatte D. A Frank-Wolfe type theorem for convex polynomial programs. Comp. Optim. & Appl. 2002;22:37–48.
- Zalinescu C. Convex analysis in general vector spaces. River Edge, NJ: World Scientific; 2002.
- Jeyakumar V, Li G. Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 2010;20:3384–3407.
- Jeyakumar V, Vicente-Pérez J. Semidefinite programming duals without a duality gap for a class of convex minimax programs. J. Optim. Theor. Appl. in press.
- Jeyakumar V, Li G, Vicente-Pérez J. Robust SOS-convex polynomial programs: exact SDP relaxations. UNSW, preprint. 2013.
- Lasserre JB. Moments, positive polynomials and their applications. London: Imperial College Press; 2009.
- Beck A, Ben-Tal A. Duality in robust optimization: primal worst equals dual best. Oper. Res. Lett. 2009;37:1–6.
- Jeyakumar V, Luc DT. Nonsmooth vector functions and continuous optimization. Vol. 10. New York: Springer; 2008.
- Goberna MA, Guerra-Vazquez F, Todorov MI. Constraint qualifications in linear vector semi-infinite optimization. Eur. J. Oper. Res. 2013;227:12–21.
- Auslender A, Teboulle M. Asymptotic cones and functions in optimization and variational inequalities. Springer Monographs in Mathematics. New York: Springer-Verlag; 2003.
- Hiriart-Urruty JB, Lemaréchal C. Convex analysis and minimization algorithms I. Grundlehren der mathematischen Wissenschaften, Berlin: Springer; 1993.
- Jeyakumar V, Lee GM, Dinh N. New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs. SIAM J. Optim. 2003;14:534–547.