IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v92y2025i3d10.1007_s10589-025-00710-y.html
   My bibliography  Save this article

Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs

Author

Listed:
  • Evren M. Turan

    (Norwegian University of Science and Technology (NTNU), Department of Chemical Engineering)

  • Johannes Jäschke

    (Norwegian University of Science and Technology (NTNU), Department of Chemical Engineering)

  • Rohit Kannan

    (Virginia Tech, Grado Department of Industrial and Systems Engineering)

Abstract

We use sensitivity analysis to design bounding-focused discretization (cutting-surface) methods for the global optimization of nonconvex semi-infinite programs (SIPs). We begin by formulating the optimal bounding-focused discretization of SIPs as a max-min problem and propose variants that are more computationally tractable. We then use parametric sensitivity theory to design an effective heuristic approach for solving these max-min problems. We also show how our new iterative discretization methods may be modified to ensure that the solutions of their discretizations converge to an optimal solution of the SIP. We then formulate optimal bounding-focused generalized discretization of SIPs as max-min problems and design heuristic algorithms for their solution. Numerical experiments on standard nonconvex SIP test instances from the literature demonstrate that our new bounding-focused discretization methods can significantly reduce the number of iterations for convergence relative to a state-of-the-art feasibility-focused discretization method.

Suggested Citation

  • Evren M. Turan & Johannes Jäschke & Rohit Kannan, 2025. "Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs," Computational Optimization and Applications, Springer, vol. 92(3), pages 1035-1068, December.
    • Handle: RePEc:spr:coopap:v:92:y:2025:i:3:d:10.1007_s10589-025-00710-y
    DOI: 10.1007/s10589-025-00710-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-025-00710-y
    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/s10589-025-00710-y?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:coopap:v:92:y:2025:i:3:d:10.1007_s10589-025-00710-y. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.