Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data

• Ahmadi, A. A., & Parrilo, P. A. (2012). A convex polynomial that is not SOS-convex. Mathematical Programming, 135(1–2), 275–292.

  Article  Google Scholar 

• Ahmadi, A. A., & Parrilo, P. A. (2013). A complete characterization of the gap between convexity and SOS-convexity. SIAM Journal on Optimization, 23(2), 811–833.

  Article  Google Scholar 

• Beck, A., & Ben-Tal, A. (2009). Duality in robust optimization: Primal worst equals dual best. Operations Research Letters, 37(1), 1–6.

  Article  Google Scholar 

• Belousov, E. G., & Klatte, D. (2002). A Frank–Wolfe type theorem for convex polynomial programs. Computational Optimization and Applications, 22(1), 37–48.

  Article  Google Scholar 

• Ben-Tal, A., Ghaoui, L. E., & Nemirovski, A. (2009). Robust optimization. Princeton, NJ and Oxford: Princeton University Press.

  Book  Google Scholar 

• Ben-Tal, A., & Nemirovski, A. (1998). Robust convex optimization. Mathematics of Operations Research, 23(4), 769–805.

  Article  Google Scholar 

• Bertsimas, D., Brown, D., & Caramanis, C. (2011). Theory and applications of robust optimization. SIAM Review, 53(3), 464–501.

  Article  Google Scholar 

• Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press.

  Book  Google Scholar 

• Chankong, V., & Haimes, Y. Y. (1983). Multiobjective decision making: Theory and methodology. Amsterdam: North-Holland.

  Google Scholar 

• Chieu, N. H., Feng, J. W., Gao, W., Li, G., & Wu, D. (2018). SOS-convex semialgebraic programs and its applications to robust optimization: A tractable class of nonsmooth convex optimization. Set-Valued and Variational Analysis, 26(2), 305–326.

  Article  Google Scholar 

• Chuong, T. D. (2016). Optimality and duality for robust multiobjective optimization problems. Nonlinear Analysis, 134, 127–143.

  Article  Google Scholar 

• Chuong, T. D. (2017). Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization. Operations Research Letters, 45, 575–580.

  Article  Google Scholar 

• Chuong, T. D. (2018). Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs. SIAM Journal on Optimization, 28(3), 2466–2488.

  Article  Google Scholar 

• Chuong, T. D., & Jeyakumar, V. (2018). Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the slater condition. Journal of Convex Analysis, 25(4), 1159–1182.

  Google Scholar 

• Crespi, G. P., Kuroiwa, D., & Rocca, M. (2018). Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization. Annals of Operations Research, 251(1–2), 89–104.

  Google Scholar 

• Doolittle, E. K., Kerivin, H. L. M., & Wiecek, M. M. (2018). Robust multiobjective optimization problem with application to internet routing. Annals of Operations Research, 271(2), 487–525.

  Article  Google Scholar 

• Ehrgott, M. (2005). Multicriteria optimization (2nd ed.). New York: Springer.

  Google Scholar 

• Ehrgott, M., & Ruzika, S. (2008). Improved \(\epsilon \)-constraint method for multiobjective progamming. Journal of Optimization Theory and Applications, 138(3), 375–396.

  Article  Google Scholar 

• Geoffrion, A. M. (1971). Duality in nonlinear programming: A simplified applications-oriented development. SIAM Review, 13, 1–37.

  Article  Google Scholar 

• Goldfarb, D., & Iyengar, G. (2003). Robust convex quadratically constrained programs. Mathematical Programming, 97(3), 495–515.

  Article  Google Scholar 

• Grant, M. C., & Boyd, S. P. (2013). The CVX user’s guide, release 2.0. User manual. Available at http://cvxr.com/cvx.

• Helton, J. W., & Nie, J. W. (2010). Semidefinite representation of convex sets. Mathematical Programming, 122(1), 21–64.

  Article  Google Scholar 

• Ide, J., & Schöbel, A. (2016). Robustness for uncertain multi-objective optimization: A survey and analysis of different concepts. OR Spectrum, 38(1), 235–271.

  Article  Google Scholar 

• Jeyakumar, V., Li, G., & Vicente-Pérez, J. (2015). Robust SOS-convex polynomial optimization problems: Exact SDP relaxations. Optimization Letters, 9(1), 1–18.

  Article  Google Scholar 

• Jeyakumar, V., Li, G., & Wang, J. H. (2013). Some robust convex programs without a duality gap. Journal of Convex Analysis, 20(2), 377–394.

  Google Scholar 

• Lee, J. H., & Jiao, L. G. (2018). Solving fractional multicriteria optimization problems with sum of squares convex polynomial data. Journal of Optimization Theory and Applications, 176(2), 428–455.

  Article  Google Scholar 

• Lee, J. H., & Lee, G. M. (2018). On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems. Annals of Operations Research, 269(1–2), 419–438.

  Article  Google Scholar 

• Lasserre, J. B. (2009a). Moments, positive polynomials and their applications. London: Imperial College Press.

  Book  Google Scholar 

• Lasserre, J. B. (2009b). Convexity in semialgebraic geometry and polynomial optimization. SIAM Journal on Optimization, 19(4), 1995–2014.

  Article  Google Scholar 

• Reznick, B. (1978). Extremal PSD forms with few terms. Duke Mathematical Journal, 45(2), 363–374.

  Article  Google Scholar 

• Rockafellar, R. T. (1970). Convex analysis. Princeton, NJ: Princeton University Press.

  Book  Google Scholar 

• Toh, K. C., Todd, M. J., & Tütüncü, R. H. (1999). SDPT3–A Matlab software package for semidefinite programming. Optimization Methods and Software, 11(1–4), 545–581.

  Article  Google Scholar 

• Vandenberghe, L., & Boyd, S. (1996). Semidefinite programming. SIAM Review, 38(1), 49–95.

  Article  Google Scholar 

• Wiecek, M. M., & Dranichak, G. M. (2016). Robust multiobjective optimization for decision making under uncertainty and conflict. In A. Gupta, & A. Capponi (Eds.), TutORials in operations research, optimization challenges in complex, networked, and risky systems (pp. 84–114). INFORMS.

Download references