Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems

References

• Ben-Tal A, El Ghaoui L, Nemirovski A. Robust optimization. Princeton (NJ): Princeton University Press; 2009. (Princeton Ser. Appl. Math.).
   Google Scholar
• Bertsimas D, Goyal V. On the approximability of adjustable robust convex optimization under uncertainty. Math Meth Oper Res. 2013;77(3):323–343.
   Web of Science ®Google Scholar
• Marandi A, den Hertog D. When are static and adjustable robust optimization problems with constraint-wise uncertainty equivalent?. Math Program. 2018;170(2 Ser. A):555–568.
   PubMed Web of Science ®Google Scholar
• Ahmadi AA, Majumdar A. Some applications of polynomial optimization in operations research and real-time decision making. Optim Lett. 2015;10(4):1–21.
   Web of Science ®Google Scholar
• Ben-Tal A, Den Hertog D, Vial JP. Deriving robust counterparts of nonlinear uncertain inequalities. Math Program. 2015;149:265–299.
   Web of Science ®Google Scholar
• Bertsimas D, Brown DB, Caramanis C. Theory and applications of robust optimization. SIAM Rev. 2011;53:464–501.
   Web of Science ®Google Scholar
• Chieu NH, Feng JW, Gao W, et al. SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization. Set-Valued Var Anal. 2018;26(2):305–326.
   Web of Science ®Google Scholar
• Jeyakumar V, Li G, Vicente-Perez J. Robust SOS-convex polynomial programs: exact SDP relaxations. Optim Lett. 2015;9(1):1–18.
   Web of Science ®Google Scholar
• Jeyakumar V, Li G. Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems. SIAM J Optim. 2018;28:760–787.
   Web of Science ®Google Scholar
• Ben-Tal A, Goryashko A, Guslitzer E, et al. Adjustable robust solutions of uncertain linear programs. Math Program. 2004;99(2 Ser. A):351–376.
   Web of Science ®Google Scholar
• Delage E, Iancu DA. Robust multistage decision making. INFORMS tutorials in operations research. Chap. 2, 2015. p. 20–46.
   Google Scholar
• Chuong TD, Jeyakumar V. Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition. J Convex Anal. 2018;25(4):1159–1182.
   Web of Science ®Google Scholar
• Lasserre JB. Moments, positive polynomials and their applications. London: Imperial College Press; 2009.
   Google Scholar
• Laurent M. Sums of squares, moment matrices and optimization over polynomials. In: Putinar M, Sullivant S, editors, Emerging applications of algebraic geometry. Springer; 2009. p. 157–270. (IMA Volumes in Mathematics and its Applications; 149).
   Google Scholar
• Ahmadi AA, Parrilo PA. A complete characterization of the gap between convexity and SOS-convexity. SIAM J Optim. 2013;23(2):811–833.
   Web of Science ®Google Scholar
• Helton JW, Nie J. Semidefinite representation of convex sets. Math Program Ser A. 2010;122:21–64.
   Web of Science ®Google Scholar
• Blekherman G, Parrilo PA, Thomas R. Semidefinite optimization and convex algebraic geometry. Philadelphia (PA): SIAM Publications; 2012.
   Google Scholar
• Ahmadi AA, Parrilo PA. A convex polynomial that is not SOS-convex. Math Program. 2012;135(1–2 Ser. A):275–292.
   Web of Science ®Google Scholar
• Ramana M, Goldman AJ. Some geometric results in semi-definite programming. J Global Optim. 1995;7:33–50.
   Web of Science ®Google Scholar
• Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970.
   Google Scholar
• Sion M. On general minimax theorems. Pacific J Math. 1958;8:171–176.
   Google Scholar
• Ben-Tal A, Nemirovski A. Robust convex optimization. Math Oper Res. 1998;23:769–805.
   Web of Science ®Google Scholar
• Parrilo PA. Polynomial optimization, sums of squares, and applications. Semidefinite optimization and convex algebraic geometry. Philadelphia (PA): SIAM; 2013. p. 47–157. (MOS-SIAM Ser. Optim.; 13).
   Google Scholar
• Grant M, Boyd S. Graph implementations for nonsmooth convex programs. In: Blondel V, Boyd S, Kimura H, editors, Recent Advances in learning and control. Springer; 2008. p. 95-110. (Lecture Notes in Control and Information Sciences).
   Google Scholar
• Grant M, Boyd S. CVX: Matlab software for disciplined convex programming. March 2014. version 2.1. Available from: http://cvxr.com/cvx.
   Google Scholar
• Boyd S, Vandenberghe L. Convex optimization. Cambridge: Cambridge University Press; 2004.
   Google Scholar
• Goldfarb D, Iyengar G. Robust convex quadratically constrained programs. Math Program. 2003;97:495–515.
   Web of Science ®Google Scholar
• Kian R, Gürler Ülkü, Berk E. The dynamic lot-sizing problem with convex economic production costs and setups. Int J Prod Econ. 2014;155:361–379.
   Web of Science ®Google Scholar
• Rubinstein RY. Generating random vectors uniformly distributed inside and on the surface of different regions. Eur J Oper Res. 1982;10:205–209.
   Web of Science ®Google Scholar
• Gurobi Optimisation. LLC Gurobi Optimizer Reference Manual. 2020. Available from: http://www.gurobi.com.
   Google Scholar
• Toh KC, Todd MJ, Tütüncü RH. SDPT3 – a Matlab software package for semidefinite programming version 1.3. Optim Methods Softw. 1999;11:545–581.
   Web of Science ®Google Scholar
• Lofberg J. YALMIP: a toolbox for modeling and optimization in MATLAB. Proceedings of the CACSD Conference; Taipei, Taiwan; 2004.
   Google Scholar
• Ben-Tal A, Nemirovski A. Lectures on modern convex optimization: analysis, algorithms, and engineering applications. Philadelphia (PA): SIAM; 2001.
   Google Scholar