IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v71y2018i3d10.1007_s10898-017-0569-y.html
   My bibliography  Save this article

lsmear: a variable selection strategy for interval branch and bound solvers

Author

Listed:
  • Ignacio Araya

    (Escuela de Ing. Informática)

  • Bertrand Neveu

    (Imagine LIGM Université Paris–Est)

Abstract

Smear-based variable selection strategies are well-known and commonly used by branch-and-prune interval-based solvers. They estimate the impact of the variables on each constraint of the system by using the partial derivatives and the sizes of the variable domains. Then they aggregate these values, in some way, to estimate the impact of each variable on the whole system. The variable with the greatest impact is then selected. A problem of these strategies is that they, generally, consider all constraints equally important. In this work, we propose a new variable selection strategy which first weights the constraints by using the optimal Lagrangian multipliers of a linearization of the original problem. Then, the impact of the variables is computed with a typical smear-based function but taking into account the weights of the constraints. The strategy isg tested on a set of well-known benchmark instances outperforming significantly the classical variable selection strategies.

Suggested Citation

  • Ignacio Araya & Bertrand Neveu, 2018. "lsmear: a variable selection strategy for interval branch and bound solvers," Journal of Global Optimization, Springer, vol. 71(3), pages 483-500, July.
    • Handle: RePEc:spr:jglopt:v:71:y:2018:i:3:d:10.1007_s10898-017-0569-y
    DOI: 10.1007/s10898-017-0569-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-017-0569-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/s10898-017-0569-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 search for a different version of it.

    References listed on IDEAS

    as
    1. Bertrand Neveu & Gilles Trombettoni & Ignacio Araya, 2016. "Node selection strategies in interval Branch and Bound algorithms," Journal of Global Optimization, Springer, vol. 64(2), pages 289-304, February.
    2. Ignacio Araya & Gilles Trombettoni & Bertrand Neveu & Gilles Chabert, 2014. "Upper bounding in inner regions for global optimization under inequality constraints," Journal of Global Optimization, Springer, vol. 60(2), pages 145-164, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ignacio Araya & Damir Aliquintui & Franco Ardiles & Braulio Lobo, 2021. "Nonlinear biobjective optimization: improving the upper envelope using feasible line segments," Journal of Global Optimization, Springer, vol. 79(2), pages 503-520, February.
    2. Ignacio Araya & Jose Campusano & Damir Aliquintui, 2019. "Nonlinear biobjective optimization: improvements to interval branch & bound algorithms," Journal of Global Optimization, Springer, vol. 75(1), pages 91-110, September.

    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. Ignacio Araya & Jose Campusano & Damir Aliquintui, 2019. "Nonlinear biobjective optimization: improvements to interval branch & bound algorithms," Journal of Global Optimization, Springer, vol. 75(1), pages 91-110, September.
    2. Bertrand Neveu & Martin Gorce & Pascal Monasse & Gilles Trombettoni, 2019. "A generic interval branch and bound algorithm for parameter estimation," Journal of Global Optimization, Springer, vol. 73(3), pages 515-535, March.
    3. Victor Reyes & Ignacio Araya, 2021. "AbsTaylor: upper bounding with inner regions in nonlinear continuous global optimization problems," Journal of Global Optimization, Springer, vol. 79(2), pages 413-429, February.
    4. Ignacio Araya & Damir Aliquintui & Franco Ardiles & Braulio Lobo, 2021. "Nonlinear biobjective optimization: improving the upper envelope using feasible line segments," Journal of Global Optimization, Springer, vol. 79(2), pages 503-520, February.
    5. Ignacio Araya & Victor Reyes, 2016. "Interval Branch-and-Bound algorithms for optimization and constraint satisfaction: a survey and prospects," Journal of Global Optimization, Springer, vol. 65(4), pages 837-866, August.
    6. Bertrand Neveu & Gilles Trombettoni & Ignacio Araya, 2016. "Node selection strategies in interval Branch and Bound algorithms," Journal of Global Optimization, Springer, vol. 64(2), pages 289-304, February.
    7. Marendet, Antoine & Goldsztejn, Alexandre & Chabert, Gilles & Jermann, Christophe, 2020. "A standard branch-and-bound approach for nonlinear semi-infinite problems," European Journal of Operational Research, Elsevier, vol. 282(2), pages 438-452.

    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:jglopt:v:71:y:2018:i:3:d:10.1007_s10898-017-0569-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.

    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.