IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v36y2024i6p1737-1756.html
   My bibliography  Save this article

Feasibility Verification and Upper Bound Computation in Global Minimization Using Approximate Active Index Sets

Author

Listed:
  • Christian Füllner

    (Institute for Operations Research, Stochastic Optimization, Karlsruhe Institute of Technology, 76199 Karlsruhe, Germany)

  • Peter Kirst

    (Operations Research and Logistics, Wageningen University & Research, 6708 PB Wageningen, Netherlands)

  • Hendrik Otto

    (Institute for Operations Research, Stochastic Optimization, Karlsruhe Institute of Technology, 76199 Karlsruhe, Germany)

  • Steffen Rebennack

    (Institute for Operations Research, Stochastic Optimization, Karlsruhe Institute of Technology, 76199 Karlsruhe, Germany)

Abstract

We propose a new upper bounding procedure for global minimization problems with continuous variables and possibly nonconvex inequality and equality constraints. Upper bounds are crucial for standard termination criteria of spatial branch-and-bound (SBB) algorithms to ensure that they can enclose globally minimal values sufficiently well. However, whereas for most lower bounding procedures from the literature, convergence on smaller boxes is established, this does not hold for several methods to compute upper bounds even though they often perform well in practice. In contrast, our emphasis is on the convergence. We present a new approach to verify the existence of feasible points on boxes, on which upper bounds can then be determined. To this end, we resort to existing convergent feasibility verification approaches for purely equality and box constrained problems. By considering carefully designed modifications of subproblems based on the approximation of active index sets, we enhance such methods to problems with additional inequality constraints. We prove that our new upper bounding procedure finds sufficiently good upper bounds so that termination of SBB algorithms is guaranteed after a finite number of iterations. Our theoretical findings are illustrated by computational results on a large number of standard test problems. These results show that compared with interval Newton methods from the literature, our proposed method is more successful in feasibility verification for both, a full SBB implementation (42 instead of 26 test problems) and exhaustive sequences of boxes around known feasible points (120 instead of 29 test problems).

Suggested Citation

  • Christian Füllner & Peter Kirst & Hendrik Otto & Steffen Rebennack, 2024. "Feasibility Verification and Upper Bound Computation in Global Minimization Using Approximate Active Index Sets," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1737-1756, December.
  • Handle: RePEc:inm:orijoc:v:36:y:2024:i:6:p:1737-1756
    DOI: 10.1287/ijoc.2023.0162
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2023.0162
    Download Restriction: no

    File URL: https://libkey.io/10.1287/ijoc.2023.0162?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
    ---><---

    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:inm:orijoc:v:36:y:2024:i:6:p:1737-1756. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.