IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v72y2018i2d10.1007_s10898-018-0631-4.html
   My bibliography  Save this article

Global optimization of nonconvex problems with convex-transformable intermediates

Author

Listed:
  • Carlos J. Nohra

    (Carnegie Mellon University)

  • Nikolaos V. Sahinidis

    (Carnegie Mellon University)

Abstract

This paper addresses the global optimization of problems which contain convex-transformable functions. We present algorithms for identification of convex-transformable functions in general nonconvex problems, and introduce a new class of cutting planes based on recently developed relaxations for convex-transformable functions. These cutting planes correspond to the supporting hyperplanes of these convex relaxations. We integrate our recognition and cutting plane generation algorithms into the global solver BARON, and test our implementation by conducting numerical experiments on a large collection of nonconvex problems. Results demonstrate that the proposed implementation accelerates the convergence speed of the branch-and-bound algorithm, by significantly reducing computational time, number of nodes in the search tree, and required memory.

Suggested Citation

  • Carlos J. Nohra & Nikolaos V. Sahinidis, 2018. "Global optimization of nonconvex problems with convex-transformable intermediates," Journal of Global Optimization, Springer, vol. 72(2), pages 255-276, October.
    • Handle: RePEc:spr:jglopt:v:72:y:2018:i:2:d:10.1007_s10898-018-0631-4
    DOI: 10.1007/s10898-018-0631-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-018-0631-4
    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-018-0631-4?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. Faiz A. Al-Khayyal & James E. Falk, 1983. "Jointly Constrained Biconvex Programming," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 273-286, May.
    2. Ruth Misener & Christodoulos Floudas, 2014. "ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations," Journal of Global Optimization, Springer, vol. 59(2), pages 503-526, July.
    3. Hao-Chun Lu & Han-Lin Li & Chrysanthos Gounaris & Christodoulos Floudas, 2010. "Convex relaxation for solving posynomial programs," Journal of Global Optimization, Springer, vol. 46(1), pages 147-154, January.
    4. Michael R. Bussieck & Arne Stolbjerg Drud & Alexander Meeraus, 2003. "MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 114-119, February.
    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. Aldrighetti, Riccardo & Battini, Daria & Ivanov, Dmitry, 2023. "Efficient resilience portfolio design in the supply chain with consideration of preparedness and recovery investments," Omega, Elsevier, vol. 117(C).

    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. Harsha Nagarajan & Mowen Lu & Site Wang & Russell Bent & Kaarthik Sundar, 2019. "An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs," Journal of Global Optimization, Springer, vol. 74(4), pages 639-675, August.
    2. Cafieri, Sonia & Omheni, Riadh, 2017. "Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes," European Journal of Operational Research, Elsevier, vol. 260(1), pages 283-290.
    3. Boukouvala, Fani & Misener, Ruth & Floudas, Christodoulos A., 2016. "Global optimization advances in Mixed-Integer Nonlinear Programming, MINLP, and Constrained Derivative-Free Optimization, CDFO," European Journal of Operational Research, Elsevier, vol. 252(3), pages 701-727.
    4. Stuart M. Harwood & Paul I. Barton, 2017. "How to solve a design centering problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 86(1), pages 215-254, August.
    5. Jaromił Najman & Alexander Mitsos, 2019. "On tightness and anchoring of McCormick and other relaxations," Journal of Global Optimization, Springer, vol. 74(4), pages 677-703, August.
    6. Lingxun Kong & Christos T. Maravelias, 2020. "On the Derivation of Continuous Piecewise Linear Approximating Functions," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 531-546, July.
    7. Kristianto, Yohanes & Helo, Petri, 2015. "Reprint of “Product architecture modularity implications for operations economy of green supply chains”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 74(C), pages 63-80.
    8. Yanıkoğlu, İhsan & Gorissen, Bram L. & den Hertog, Dick, 2019. "A survey of adjustable robust optimization," European Journal of Operational Research, Elsevier, vol. 277(3), pages 799-813.
    9. Kai Zhou & Mustafa R. Kılınç & Xi Chen & Nikolaos V. Sahinidis, 2018. "An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver," Journal of Global Optimization, Springer, vol. 70(3), pages 497-516, March.
    10. Jung-Fa Tsai & Ming-Hua Lin, 2011. "An Efficient Global Approach for Posynomial Geometric Programming Problems," INFORMS Journal on Computing, INFORMS, vol. 23(3), pages 483-492, August.
    11. Marco Locatelli, 2014. "A technique to derive the analytical form of convex envelopes for some bivariate functions," Journal of Global Optimization, Springer, vol. 59(2), pages 477-501, July.
    12. Emily Speakman & Jon Lee, 2018. "On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation," Journal of Global Optimization, Springer, vol. 72(2), pages 129-153, October.
    13. Harold P. Benson, 2004. "Concave envelopes of monomial functions over rectangles," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 467-476, June.
    14. Farough Motamed Nasab & Zukui Li, 2023. "Multistage Adaptive Robust Binary Optimization: Uncertainty Set Lifting versus Partitioning through Breakpoints Optimization," Mathematics, MDPI, vol. 11(18), pages 1-24, September.
    15. İhsan Yanıkoğlu & Erinç Albey & Serkan Okçuoğlu, 2022. "Robust Parameter Design and Optimization for Quality Engineering," SN Operations Research Forum, Springer, vol. 3(1), pages 1-36, March.
    16. Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
    17. Marco Locatelli, 2016. "Non polyhedral convex envelopes for 1-convex functions," Journal of Global Optimization, Springer, vol. 65(4), pages 637-655, August.
    18. Jaromił Najman & Dominik Bongartz & Alexander Mitsos, 2021. "Linearization of McCormick relaxations and hybridization with the auxiliary variable method," Journal of Global Optimization, Springer, vol. 80(4), pages 731-756, August.
    19. N. V. Thoai, 2000. "Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints," Journal of Optimization Theory and Applications, Springer, vol. 107(2), pages 331-354, November.
    20. O’Brien, Thomas & Reeb, Tyler, 2016. "Freight Efficiency Strategies: Operational Modernization at Distribution Nodes," Institute of Transportation Studies, Working Paper Series qt4fg9f0gv, Institute of Transportation Studies, UC Davis.

    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:72:y:2018:i:2:d:10.1007_s10898-018-0631-4. 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.