On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (original) (raw)

References

  1. Lasserre, J.B.: Moments. Positive Polynomials and Their Applications. Imperial College Press, London (2009)
  2. Klerk, E.D., Laurent, M.: On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems. SIAM J. Optim. 21, 824–832 (2011)
    Article MathSciNet Google Scholar
  3. Ahmadi, A.A., Parrilo, P.A.: A convex polynomial that is not SOS-convex. Math. Program. 135, 275–292 (2012)
    Article MathSciNet Google Scholar
  4. Ahmadi, A.A., Parrilo, P.A.: A complete characterization of the gap between convexity and SOS-convexity. SIAM J. Optim. 23, 811–833 (2013)
    Article MathSciNet Google Scholar
  5. Ngai, H.V.: Global error bounds for systems of convex polynomial over polyhedral constraints. SIAM J. Optim. 25, 521–539 (2015)
    Article MathSciNet Google Scholar
  6. Ahmadi, A.A., Majumdar, A.: Some applications of polynomial optimization in operations research and real-time decision making. Optim. Lett. 10, 709–729 (2016)
    Article MathSciNet Google Scholar
  7. Goberna, M.A., Jeyakumar, V., Li, G., Linh, N.: Radius of robust feasibility and optimality of uncertain convex programs. Oper. Res. Lett. 44, 67–73 (2016)
    Article MathSciNet Google Scholar
  8. Jiao, L.G., Lee, J.H., Zhou, Y.Y.: A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials. Oper. Res. Lett. 48, 188–194 (2020)
    Article MathSciNet Google Scholar
  9. Li, X.B., Al-Homidan, S., Ansari, Q.H., Yao, J.C.: A sufficient condition for asymptotically well behaved property of convex polynomials. Oper. Res. Lett. 49, 548–552 (2021)
    Article MathSciNet CAS Google Scholar
  10. Lasserre, J.B.: Convexity in semialgebraic geometry and polynomial optimization. SIAM J. Optim. 19, 1995–2014 (2009)
    Article MathSciNet Google Scholar
  11. Helton, J.W., Nie, J.: Semidefinite representation of convex sets. Math. Program. 122, 21–64 (2010)
    Article MathSciNet Google Scholar
  12. Jeyakumar, V., Li, G.: Exact SDP relaxations for classes of nonlinear semidefinite programming problems. Oper. Res. Lett. 40, 529–536 (2012)
    Article MathSciNet Google Scholar
  13. Jeyakumar, V., Vicente-Pérez, J.: Dual semidefinite programs without duality gaps for a class of convex minimax programs. J. Optim. Theory Appl. 162, 735–753 (2014)
    Article MathSciNet Google Scholar
  14. Lee, J.H., Lee, G.M.: On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint. Math. Program. 169, 177–198 (2017)
    Article MathSciNet Google Scholar
  15. Ahmadi, A.A., Majumdar, A.: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization. SIAM J. Appl. Algebra Geom. 3, 193–230 (2019)
    Article MathSciNet Google Scholar
  16. Jeyakumar, V., Lee, G.M., Li, G.: Characterizing robust solution sets of convex programs under data uncertainty. J. Optim. Theory Appl. 164, 407–435 (2015)
    Article MathSciNet Google Scholar
  17. Jeyakumar, V., Li, G., Vicente-Pérez, J.: Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Lett. 9, 1–18 (2015)
    Article MathSciNet Google Scholar
  18. Chuong, T.D.: Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs. SIAM J. Optim. 28, 2466–2488 (2018)
    Article MathSciNet Google Scholar
  19. Lee, J.H., Jiao, L.G.: Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data. Ann. Oper. Res. 296, 803–820 (2021)
    Article MathSciNet Google Scholar
  20. Wang, M., Li, X.B., Chen, J.W., Al-Homidan, S.: On radius of robust feasibility for convex conic programs with data uncertainty. Numer. Funct. Anal. Optim. 42, 1896–1924 (2021)
    Article MathSciNet Google Scholar
  21. Chuong, T.D., Jeyakumar, V., Li, G.: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs. J. Glob. Optim. 75, 885–919 (2019)
    Article MathSciNet Google Scholar
  22. Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284, 193–228 (1998)
    Article MathSciNet Google Scholar
  23. Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95, 3–51 (2003)
    Article MathSciNet Google Scholar
  24. Chuong, T.D.: Second-order cone programming relaxations for a class of multiobjective convex polynomial problems. Ann. Oper. Res. 311, 1017–1033 (2022)
    Article MathSciNet Google Scholar
  25. Ramana, M., Goldman, A.J.: Some geometric results in semidefinite programming. J. Glob. Optim. 7, 33–50 (1995)
    Article MathSciNet Google Scholar
  26. Vinzant, C.: What is a spectrahedron? Notices Am. Math. Soc. 61, 492–494 (2014)
    Article MathSciNet Google Scholar
  27. Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
    Book Google Scholar
  28. Kuroiwa, D., Lee, G.M.: On robust multiobjective optimization. Vietnam J. Math. 40, 305–317 (2012)
    MathSciNet Google Scholar
  29. Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)
    Google Scholar
  30. Ben-Tal, A., Nemirovski, A.: Lectures on modern convex optimization: analysis, algorithms, and engineering applications. SIAM Philadelphia (2001)
  31. Blekherman, G., Parrilo, P.A., Thomas, R.: Semidefinite Optimization and Convex Algebraic Geometry. SIAM, Philadelphia (2012)
    Book Google Scholar
  32. Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, Version 2.1. (2014)
  33. Sun, X.K., Long, X.J., Fu, H.Y., Li, X.B.: Some characterizations of robust optimal solutions for uncertain fractional optimization and applications. J. Ind. Manag. Optim. 13, 803–824 (2017)
    Article MathSciNet Google Scholar
  34. Sisarat, N., Wangkeeree, R., Lee, G.M.: Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints. J. Ind. Manag. Optim. 16, 469–493 (2020)
    Article MathSciNet Google Scholar
  35. Kerdkaew, J., Wangkeeree, R.: Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty. J. Ind. Manag. Optim. 16, 2651–2673 (2020)
    Article MathSciNet Google Scholar
  36. Liu, J., Long, X.J., Sun, X.K.: Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferential. J. Glob. Optim. 87, 481–501 (2023)
    Article MathSciNet Google Scholar
  37. Chen, J.W., Köbis, E., Yao, J.C.: Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints. J. Optim. Theory Appl. 181, 411–436 (2019)
    Article MathSciNet Google Scholar
  38. Li, X.B., Wang, Q.L., Lin, Z.: Optimality conditions and duality for minimax fractional programming problems with data uncertainty. J. Ind. Manag. Optim. 15, 1133–1151 (2019)
    MathSciNet Google Scholar
  39. Sun, X.K., Teo, K.L., Long, X.J.: Some characterizations of approximate solutions for robust semi-infinite optimization problems. J. Optim. Theory Appl. 191, 281–310 (2021)
    Article MathSciNet Google Scholar
  40. Wang, J., Li, S.J., Chen, C.R.: Generalized robust duality in constrained nonconvex optimization. Optimization 70, 591–612 (2021)
    Article MathSciNet Google Scholar

Download references