IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v202y2024i3d10.1007_s10957-024-02458-7.html
   My bibliography  Save this article

On Global Error Bounds for Convex Inequalities Systems

Author

Listed:
  • Vo Si Trong Long

    (University of Science
    Vietnam National University)

Abstract

In this paper, we first present necessary and sufficient conditions for the existence of global error bounds for a convex function without additional conditions on the function or the solution set. In particular, we obtain characterizations of such global error bounds in Euclidean spaces, which are often simple to check. Second, we prove that under a suitable assumption the subdifferential of the supremum function of an arbitrary family of convex continuous functions coincides with the convex hull of the subdifferentials of functions corresponding to the active indices at given points. As applications, we study the existence of global error bounds for infinite systems of linear and convex inequalities. Several examples are provided as well to explain the advantages of our results with existing ones in the literature.

Suggested Citation

  • Vo Si Trong Long, 2024. "On Global Error Bounds for Convex Inequalities Systems," Journal of Optimization Theory and Applications, Springer, vol. 202(3), pages 1359-1384, September.
    • Handle: RePEc:spr:joptap:v:202:y:2024:i:3:d:10.1007_s10957-024-02458-7
    DOI: 10.1007/s10957-024-02458-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02458-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-024-02458-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. T. D. Chuong & V. Jeyakumar, 2017. "An Exact Formula for Radius of Robust Feasibility of Uncertain Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 203-226, April.
    2. M. Fajardo & J. Vicente-Pérez & M. Rodríguez, 2012. "Infimal convolution, c-subdifferentiability, and Fenchel duality in evenly convex optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(2), pages 375-396, July.
    3. Hui Hu, 2005. "Characterizations of the Strong Basic Constraint Qualifications," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 956-965, November.
    4. M. Volle & J. E. Martínez-Legaz & J. Vicente-Pérez, 2015. "Duality for Closed Convex Functions and Evenly Convex Functions," Journal of Optimization Theory and Applications, Springer, vol. 167(3), pages 985-997, December.
    5. Radu Boţ & Ernö Csetnek, 2012. "Error bound results for convex inequality systems via conjugate duality," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(2), pages 296-309, July.
    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. Hui Hu & Qing Wang, 2011. "Closedness of a Convex Cone and Application by Means of the End Set of a Convex Set," Journal of Optimization Theory and Applications, Springer, vol. 150(1), pages 52-64, July.
    2. Johannes Thürauf, 2022. "Deciding the feasibility of a booking in the European gas market is coNP-hard," Annals of Operations Research, Springer, vol. 318(1), pages 591-618, November.
    3. Goberna, M.A. & Jeyakumar, V. & Li, G. & Vicente-Pérez, J., 2018. "Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs," European Journal of Operational Research, Elsevier, vol. 270(1), pages 40-50.
    4. M. D. Fajardo & J. Vidal, 2018. "Necessary and Sufficient Conditions for Strong Fenchel–Lagrange Duality via a Coupling Conjugation Scheme," Journal of Optimization Theory and Applications, Springer, vol. 176(1), pages 57-73, January.
    5. Frauke Liers & Lars Schewe & Johannes Thürauf, 2022. "Radius of Robust Feasibility for Mixed-Integer Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 243-261, January.
    6. Hui Hu & Qing Wang, 2011. "Closedness of a Convex Cone and Application by Means of the End Set of a Convex Set," Journal of Optimization Theory and Applications, Springer, vol. 151(3), pages 633-645, December.
    7. C. Liu & K. Ng, 2015. "On error bounds for systems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 552-566, July.
    8. M. A. Goberna & M. A. López, 2018. "Recent contributions to linear semi-infinite optimization: an update," Annals of Operations Research, Springer, vol. 271(1), pages 237-278, December.
    9. Jiawei Chen & Jun Li & Xiaobing Li & Yibing Lv & Jen-Chih Yao, 2020. "Radius of Robust Feasibility of System of Convex Inequalities with Uncertain Data," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 384-399, February.
    10. Daniel Woolnough & Niroshan Jeyakumar & Guoyin Li & Clement T Loy & Vaithilingam Jeyakumar, 2022. "Robust Optimization and Data Classification for Characterization of Huntington Disease Onset via Duality Methods," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 649-675, June.
    11. María D. Fajardo & Margarita M. L. Rodríguez & José Vidal, 2016. "Lagrange Duality for Evenly Convex Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 168(1), pages 109-128, January.
    12. Goberna, M.A. & Jeyakumar, V. & Li, G. & Vicente-Pérez, J., 2022. "The radius of robust feasibility of uncertain mathematical programs: A Survey and recent developments," European Journal of Operational Research, Elsevier, vol. 296(3), pages 749-763.
    13. Kaiwen Meng & Vera Roshchina & Xiaoqi Yang, 2015. "On Local Coincidence of a Convex Set and its Tangent Cone," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 123-137, January.
    14. M. A. Goberna & V. Jeyakumar & G. Li, 2021. "Calculating Radius of Robust Feasibility of Uncertain Linear Conic Programs via Semi-definite Programs," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 597-622, May.
    15. Zhou Wei & Jen-Chih Yao, 2018. "On Several Types of Basic Constraint Qualifications via Coderivatives for Generalized Equations," Journal of Optimization Theory and Applications, Springer, vol. 177(1), pages 106-126, April.
    16. Thai Doan Chuong, 2021. "Radius of Robust Global Error Bound for Piecewise Linear Inequality Systems," Journal of Optimization Theory and Applications, Springer, vol. 191(1), pages 68-82, October.

    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:spr:joptap:v:202:y:2024:i:3:d:10.1007_s10957-024-02458-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.