IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v265y2018i1d10.1007_s10479-017-2518-z.html
   My bibliography  Save this article

How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results

Author

Listed:
  • János D. Pintér

    (Lehigh University
    PCS Inc.)

Abstract

Nonlinear optimization (NLO) encompasses a vast range of problems, from very simple to theoretically intractable instances. For this reason, it is impossible to offer guaranteed—while practically meaningful—advice to users of NLO software. This issue becomes apparent, when facing exceptionally hard and/or previously unexplored NLO challenges. We propose a heuristic quadratic meta-model based approach, and suggest corresponding key option settings to use with the Lipschitz global optimizer (LGO) solver suite. These LGO option settings are directly related to estimating the sufficient computational effort to handle a broad range of NLO problems. The proposed option settings are evaluated experimentally, by solving (numerically) a representative set of NLO test problems which are based on real-world optimization applications and non-trivial academic challenges. Our tests include also a set of scalable optimization problems which are increasingly difficult to handle as the size of the model-instances increases. Based on our computational results, it is possible to offer generally valid, practical advice to LGO users. Arguably (and mutatis mutandis), comparable advice can be given to users of other NLO software products with a similarly broad mandate to LGO’s. An additional benefit of such aggregated tests is that their results can effectively assist the rapid evaluation and verification of NLO solver performance during software development phases.

Suggested Citation

  • János D. Pintér, 2018. "How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results," Annals of Operations Research, Springer, vol. 265(1), pages 119-141, June.
    • Handle: RePEc:spr:annopr:v:265:y:2018:i:1:d:10.1007_s10479-017-2518-z
    DOI: 10.1007/s10479-017-2518-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2518-z
    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/s10479-017-2518-z?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. Castillo, Ignacio & Kampas, Frank J. & Pintér, János D., 2008. "Solving circle packing problems by global optimization: Numerical results and industrial applications," European Journal of Operational Research, Elsevier, vol. 191(3), pages 786-802, December.
    2. Luis Rios & Nikolaos Sahinidis, 2013. "Derivative-free optimization: a review of algorithms and comparison of software implementations," Journal of Global Optimization, Springer, vol. 56(3), pages 1247-1293, July.
    3. J. Tervo & P. Kolmonen & T. Lyyra-Laitinen & J.D. Pintér & T. Lahtinen, 2003. "An Optimization-Based Approach to the Multiple Static Delivery Technique in Radiation Therapy," Annals of Operations Research, Springer, vol. 119(1), pages 205-227, March.
    4. Jack P.C. Kleijnen, 2015. "Design and Analysis of Simulation Experiments," International Series in Operations Research and Management Science, Springer, edition 2, number 978-3-319-18087-8, April.
    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. János Pintér & Zoltán Horváth, 2013. "Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints," Journal of Global Optimization, Springer, vol. 57(1), pages 191-215, September.
    2. Satyajith Amaran & Nikolaos V. Sahinidis & Bikram Sharda & Scott J. Bury, 2016. "Simulation optimization: a review of algorithms and applications," Annals of Operations Research, Springer, vol. 240(1), pages 351-380, May.
    3. Mustafa Çağlayan & János Pintér, 2013. "Development and calibration of a currency trading strategy using global optimization," Journal of Global Optimization, Springer, vol. 56(2), pages 353-371, June.
    4. Frank J. Kampas & János D. Pintér & Ignacio Castillo, 2020. "Packing ovals in optimized regular polygons," Journal of Global Optimization, Springer, vol. 77(1), pages 175-196, May.
    5. Jonas Bjerg Thomsen & Francesco Ferri & Jens Peter Kofoed & Kevin Black, 2018. "Cost Optimization of Mooring Solutions for Large Floating Wave Energy Converters," Energies, MDPI, vol. 11(1), pages 1-23, January.
    6. Rennen, G. & Husslage, B.G.M. & van Dam, E.R. & den Hertog, D., 2009. "Nested Maximin Latin Hypercube Designs," Discussion Paper 2009-06, Tilburg University, Center for Economic Research.
    7. Ehsan Mehdad & Jack P. C. Kleijnen, 2018. "Efficient global optimisation for black-box simulation via sequential intrinsic Kriging," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(11), pages 1725-1737, November.
    8. Wen Shi & Xi Chen & Jennifer Shang, 2019. "An Efficient Morris Method-Based Framework for Simulation Factor Screening," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 745-770, October.
    9. Akang Wang & Christopher L. Hanselman & Chrysanthos E. Gounaris, 2018. "A customized branch-and-bound approach for irregular shape nesting," Journal of Global Optimization, Springer, vol. 71(4), pages 935-955, August.
    10. Tim Voigt & Martin Kohlhase & Oliver Nelles, 2021. "Incremental DoE and Modeling Methodology with Gaussian Process Regression: An Industrially Applicable Approach to Incorporate Expert Knowledge," Mathematics, MDPI, vol. 9(19), pages 1-26, October.
    11. Tian, Wei & Song, Jitian & Li, Zhanyong & de Wilde, Pieter, 2014. "Bootstrap techniques for sensitivity analysis and model selection in building thermal performance analysis," Applied Energy, Elsevier, vol. 135(C), pages 320-328.
    12. Gabriela Simonet & Julie Subervie & Driss Ezzine-De-Blas & Marina Cromberg & Amy Duchelle, 2015. "Paying smallholders not to cut down the amazon forest: impact evaluation of a REDD+ pilot project," Working Papers 1514, Chaire Economie du climat.
    13. Somayeh Moazeni & Warren B. Powell & Boris Defourny & Belgacem Bouzaiene-Ayari, 2017. "Parallel Nonstationary Direct Policy Search for Risk-Averse Stochastic Optimization," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 332-349, May.
    14. Zhang, Wei & (Ato) Xu, Wangtu, 2017. "Simulation-based robust optimization for the schedule of single-direction bus transit route: The design of experiment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 203-230.
    15. Shi, Wen & Liu, Zhixue & Shang, Jennifer & Cui, Yujia, 2013. "Multi-criteria robust design of a JIT-based cross-docking distribution center for an auto parts supply chain," European Journal of Operational Research, Elsevier, vol. 229(3), pages 695-706.
    16. Alfieri, Arianna & Matta, Andrea, 2012. "Mathematical programming formulations for approximate simulation of multistage production systems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 773-783.
    17. İ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.
    18. T. Kubach & A. Bortfeldt & H. Gehring, 2009. "Parallel greedy algorithms for packing unequal circles into a strip or a rectangle," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(4), pages 461-477, December.
    19. Arianna Alfieri & Andrea Matta & Giulia Pedrielli, 2015. "Mathematical programming models for joint simulation–optimization applied to closed queueing networks," Annals of Operations Research, Springer, vol. 231(1), pages 105-127, August.
    20. Jakubik, Johannes & Binding, Adrian & Feuerriegel, Stefan, 2021. "Directed particle swarm optimization with Gaussian-process-based function forecasting," European Journal of Operational Research, Elsevier, vol. 295(1), pages 157-169.

    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:annopr:v:265:y:2018:i:1:d:10.1007_s10479-017-2518-z. 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.