IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v21y2013i1p133-162.html
   My bibliography  Save this article

Benchmarking nonlinear optimization software in technical computing environments

Author

Listed:
  • János Pintér
  • Frank Kampas

Abstract

Our strategic objective is to develop a broadly categorized, expandable collection of test problems, to support the benchmarking of nonlinear optimization software packages in integrated technical computing environments (ITCEs). ITCEs—such as Maple, Mathematica, and MATLAB—support concise, modular and scalable model development: their built-in documentation and visualization features can be put to good use also in test model selection and analysis. ITCEs support the flexible inclusion of both new models and general-purpose solver engines for future studies. Within this broad context, in this article we review a collection of global optimization problems coded in Mathematica, and present illustrative and summarized numerical results obtained using the MathOptimizer Professional software package. Copyright Sociedad de Estadística e Investigación Operativa 2013

Suggested Citation

  • János Pintér & Frank Kampas, 2013. "Benchmarking nonlinear optimization software in technical computing environments," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 133-162, April.
    • Handle: RePEc:spr:topjnl:v:21:y:2013:i:1:p:133-162
    DOI: 10.1007/s11750-011-0209-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-011-0209-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-011-0209-5?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. Jonathan P. K. Doye & Robert H. Leary & Marco Locatelli & Fabio Schoen, 2004. "Global Optimization of Morse Clusters by Potential Energy Transformations," INFORMS Journal on Computing, INFORMS, vol. 16(4), pages 371-379, November.
    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. Lai, Xiangjing & Hao, Jin-Kao & Yue, Dong & Lü, Zhipeng & Fu, Zhang-Hua, 2022. "Iterated dynamic thresholding search for packing equal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 299(1), pages 137-153.
    2. 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.
    3. Marco Baioletti & Valentino Santucci & Marco Tomassini, 2024. "A performance analysis of Basin hopping compared to established metaheuristics for global optimization," Journal of Global Optimization, Springer, vol. 89(3), pages 803-832, July.
    4. Locatelli, Marco & Schoen, Fabio, 2012. "Local search based heuristics for global optimization: Atomic clusters and beyond," European Journal of Operational Research, Elsevier, vol. 222(1), pages 1-9.
    5. 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.
    6. I Al-Mudahka & M Hifi & R M'Hallah, 2011. "Packing circles in the smallest circle: an adaptive hybrid algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1917-1930, November.
    7. Edwin Dam & Bart Husslage & Dick Hertog, 2010. "One-dimensional nested maximin designs," Journal of Global Optimization, Springer, vol. 46(2), pages 287-306, February.
    8. Galiev, Shamil I. & Lisafina, Maria S., 2013. "Linear models for the approximate solution of the problem of packing equal circles into a given domain," European Journal of Operational Research, Elsevier, vol. 230(3), pages 505-514.
    9. Giorgio Fasano, 2013. "A global optimization point of view to handle non-standard object packing problems," Journal of Global Optimization, Springer, vol. 55(2), pages 279-299, February.
    10. 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.
    11. Xiangyang Huang & LiGuo Huang, 2023. "Spreading Points Using Gradient and Tabu," SN Operations Research Forum, Springer, vol. 4(2), pages 1-11, June.
    12. Zeng, Zhizhong & Yu, Xinguo & He, Kun & Huang, Wenqi & Fu, Zhanghua, 2016. "Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container," European Journal of Operational Research, Elsevier, vol. 250(2), pages 615-627.
    13. Hinostroza, Ignacio & Pradenas, Lorena & Parada, Víctor, 2013. "Board cutting from logs: Optimal and heuristic approaches for the problem of packing rectangles in a circle," International Journal of Production Economics, Elsevier, vol. 145(2), pages 541-546.
    14. B. Addis & M. Locatelli & F. Schoen, 2008. "Disk Packing in a Square: A New Global Optimization Approach," INFORMS Journal on Computing, INFORMS, vol. 20(4), pages 516-524, November.
    15. Huang, Wenqi & Ye, Tao, 2011. "Global optimization method for finding dense packings of equal circles in a circle," European Journal of Operational Research, Elsevier, vol. 210(3), pages 474-481, May.
    16. Piotr Łukasiak & Jacek Błażewicz & Maciej Miłostan, 2010. "Some operations research methods for analyzing protein sequences and structures," Annals of Operations Research, Springer, vol. 175(1), pages 9-35, March.
    17. 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.
    18. Wang, Yingcong & Wang, Yanfeng & Sun, Junwei & Huang, Chun & Zhang, Xuncai, 2019. "A stimulus–response-based allocation method for the circle packing problem with equilibrium constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 232-247.
    19. Ambros Gleixner & Stephen J. Maher & Benjamin Müller & João Pedro Pedroso, 2020. "Price-and-verify: a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition," Annals of Operations Research, Springer, vol. 284(2), pages 527-555, January.
    20. Fu, Zhanghua & Huang, Wenqi & Lü, Zhipeng, 2013. "Iterated tabu search for the circular open dimension problem," European Journal of Operational Research, Elsevier, vol. 225(2), pages 236-243.

    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:topjnl:v:21:y:2013:i:1:p:133-162. 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.