IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i7p1175-d786775.html
   My bibliography  Save this article

An Alternating Iteration Algorithm for a Parameter-Dependent Distributionally Robust Optimization Model

Author

Listed:
  • Shuang Lin

    (Department of Basic Courses Teaching, Dalian Polytechnic University, Dalian 116034, China)

  • Jie Zhang

    (School of Mathematics, Liaoning Normal University, Dalian 116029, China)

  • Nan Shi

    (School of Mathematics, Liaoning Normal University, Dalian 116029, China)

Abstract

Based on a successive convex programming method, an alternating iteration algorithm is proposed for solving a parameter-dependent distributionally robust optimization. Under the Slater-type condition, the convergence analysis of the algorithm is obtained. When the objective function is convex, a modified algorithm is proposed and a less-conservative solution is obtained. Lastly, some numerical tests results are illustrated to show the efficiency of the algorithm.

Suggested Citation

  • Shuang Lin & Jie Zhang & Nan Shi, 2022. "An Alternating Iteration Algorithm for a Parameter-Dependent Distributionally Robust Optimization Model," Mathematics, MDPI, vol. 10(7), pages 1-12, April.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:7:p:1175-:d:786775
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/7/1175/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/7/1175/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    2. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    3. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    4. Georg Pflug & David Wozabal, 2007. "Ambiguity in portfolio selection," Quantitative Finance, Taylor & Francis Journals, vol. 7(4), pages 435-442.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    2. Steffen Rebennack, 2022. "Data-driven stochastic optimization for distributional ambiguity with integrated confidence region," Journal of Global Optimization, Springer, vol. 84(2), pages 255-293, October.
    3. Yannan Chen & Hailin Sun & Huifu Xu, 2021. "Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems," Computational Optimization and Applications, Springer, vol. 78(1), pages 205-238, January.
    4. Jose Blanchet & Karthyek Murthy, 2019. "Quantifying Distributional Model Risk via Optimal Transport," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 565-600, May.
    5. Viet Anh Nguyen & Soroosh Shafiee & Damir Filipovi'c & Daniel Kuhn, 2021. "Mean-Covariance Robust Risk Measurement," Papers 2112.09959, arXiv.org, revised Nov 2023.
    6. Jose Blanchet & Lin Chen & Xun Yu Zhou, 2022. "Distributionally Robust Mean-Variance Portfolio Selection with Wasserstein Distances," Management Science, INFORMS, vol. 68(9), pages 6382-6410, September.
    7. Feng Liu & Zhi Chen & Shuming Wang, 2023. "Globalized Distributionally Robust Counterpart," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1120-1142, September.
    8. Nilay Noyan & Gábor Rudolf & Miguel Lejeune, 2022. "Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 729-751, March.
    9. Viet Anh Nguyen & Daniel Kuhn & Peyman Mohajerin Esfahani, 2018. "Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator," Papers 1805.07194, arXiv.org.
    10. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    11. Longsheng Sun & Mark H. Karwan & Changhyun Kwon, 2018. "Generalized Bounded Rationality and Robust Multicommodity Network Design," Operations Research, INFORMS, vol. 66(1), pages 42-57, 1-2.
    12. Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang, 2021. "Robust Capacity Planning for Project Management," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1533-1550, October.
    13. Ran Ji & Miguel A. Lejeune, 2021. "Data-Driven Optimization of Reward-Risk Ratio Measures," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1120-1137, July.
    14. Yang, Yongjian & Yin, Yunqiang & Wang, Dujuan & Ignatius, Joshua & Cheng, T.C.E. & Dhamotharan, Lalitha, 2023. "Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1042-1062.
    15. Wang, Fan & Zhang, Chao & Zhang, Hui & Xu, Liang, 2021. "Short-term physician rescheduling model with feature-driven demand for mental disorders outpatients," Omega, Elsevier, vol. 105(C).
    16. Liu, Haiyan & Mao, Tiantian, 2022. "Distributionally robust reinsurance with Value-at-Risk and Conditional Value-at-Risk," Insurance: Mathematics and Economics, Elsevier, vol. 107(C), pages 393-417.
    17. Ren, Ke & Bidkhori, Hoda, 2023. "A study of data-driven distributionally robust optimization with incomplete joint data under finite support," European Journal of Operational Research, Elsevier, vol. 305(2), pages 754-765.
    18. Ran Ji & Miguel A. Lejeune, 2021. "Data-driven distributionally robust chance-constrained optimization with Wasserstein metric," Journal of Global Optimization, Springer, vol. 79(4), pages 779-811, April.
    19. Wang, Yu & Zhang, Yu & Tang, Jiafu, 2019. "A distributionally robust optimization approach for surgery block allocation," European Journal of Operational Research, Elsevier, vol. 273(2), pages 740-753.
    20. Huyên Pham & Xiaoli Wei & Chao Zhou, 2022. "Portfolio diversification and model uncertainty: A robust dynamic mean‐variance approach," Mathematical Finance, Wiley Blackwell, vol. 32(1), pages 349-404, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:7:p:1175-:d:786775. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.