Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 71, 2022 - Issue 7
215
Views
4
CrossRef citations to date
0
Altmetric
Articles

Necessary optimality conditions for nonsmooth robust optimization problems

ORCID Icon, ORCID Icon &
Pages 1817-1837 | Received 21 Apr 2020, Accepted 28 Sep 2020, Published online: 22 Oct 2020

References

  • Soyster AL. Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res. 1973;21:1154–1157.
  • Ben-Tal A, Nemirovski A. Robust convex optimization. Math Oper Res. 1998;23:769–805.
  • Ben-Tal A, El Ghaoui L, Nemirovski A. Robust optimization. Princeton (NJ): Princeton University Press; 2009.
  • Kouvelis P, Yu G. Robust discrete optimization and its applications. Amsterdam: Kluwer Academic Publishers; 1997.
  • Jeyakumar V, Lee GM, Li GY. Characterizing robust solution sets of convex programs under data uncertainty. J Optim Theory Appl. 2015;164:407–435.
  • Li XB, Wang S. Characterizations of robust solution set of convex programs with uncertain data. Optim Lett. 2018;12:1387–1402.
  • Sun XK, Teo KL, Tang LP. Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems. J Optim Theory Appl. 2019;182:984–1000.
  • Lee GM, Son PT. On nonsmooth optimality theorems for robust optimization problems. Bull Korean Math Soc. 2014;51:287–301.
  • Gorissen BL, Blanc H, Ben-Tal A. Technical note-deriving robust and globalized robust solutions of uncertain linear programs with general convex uncertainty sets. Oper Res. 2014;62:672–679.
  • Sun XK, Peng ZY, Guo XL. Some characterizations of robust optimal solutions for uncertain convex optimization problems. Optim Lett. 2016;10:1463–1478.
  • Klamroth K, Köbis E, Schöbel A, et al. A unified approach for different kinds of robustness and stochastic programming via nonlinear scalarizing functionals. Optimization. 2013;62:649–671.
  • Klamroth K, Köbis E, Schöbel A, et al. A unified approach to uncertain optimization. Eur J Oper Res. 2017;260:403–420.
  • Giannessi F. Constrained optimization and image space analysis. Separation of sets and optimality conditions. Vol. 1, New York (NY): Springer; 2005.
  • Wei HZ, Chen CR, Li SJ. Characterizations for optimality conditions of general robust optimization problems. J Optim Theory Appl. 2018;177:835–856.
  • Wei HZ, Chen CR, Li SJ. A unified approach through image space analysis to robustness in uncertain optimization problems. J Optim Theory Appl. 2020;184:466–493.
  • Wei HZ, Chen CR, Li SJ. Robustness characterizations for uncertain optimization problems via image space analysis. J Optim Theory Appl. 2020;186:459–479.
  • Giannessi F. Theorems of the alternative and optimality conditions. J Optim Theory Appl. 1984;42:331–365.
  • Giannessi F. General optimality conditions via a separation scheme. In: Spedicato E, editor. Algorithms for continuous optimization. Dordrecht: Kluwer Academic; 1994. p. 1–23.
  • Li SJ, Xu YD, Zhu SK. Nonlinear separation approach to constrained extremum problems. J Optim Theory Appl. 2012;154:842–856.
  • Xu YD. Nonlinear separation approach to inverse variational inequalities. Optimization. 2016;65:1315–1335.
  • Li SJ, Xu YD, You MX, et al. Constrained extremum problems and image space analysis-part I: optimality conditions. J Optim Theory Appl. 2018;177:609–636.
  • Hiriart-Urruty JB. Tangent cone, generalized gradients and mathematical programming in Banach spaces. Math Oper Res. 1979;4:79–97.
  • Gerth(Tammer) C, Weidner P. Nonconvex separation theorems and some applications in vector optimization. J Optim Theory Appl. 1990;67:297–320.
  • Wei HZ, Chen CR, Li SJ. A unified characterization of multiobjective robustness via separation. J Optim Theory Appl. 2018;179:86–102.
  • Ansari QH, Köbis E, Sharma PK. Characterizations of multiobjective robustness via oriented distance function and image space analysis. J Optim Theory Appl. 2019;181:817–839.
  • Wei HZ, Chen CR, Li SJ. Characterizations of multiobjective robustness on vectorization counterparts. Optimization. 2020;69:493–518.
  • Chen JW, Huang L, Lv YB, et al. Optimality conditions of robust convex multiobjective optimization via ε-constraint scalarization and image space analysis. Optimization. 2020;69:1849–1879.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.