IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v155y2012i3d10.1007_s10957-012-0112-8.html
   My bibliography  Save this article

A Mesh Adaptive Basin Hopping Method for the Design of Circular Antenna Arrays

Author

Listed:
  • Giovanni Stracquadanio

    (Johns Hopkins University)

  • Elisa Pappalardo

    (University of Florida
    University of Catania)

  • Panos M. Pardalos

    (University of Florida)

Abstract

The design of circular antenna arrays is a challenging optimization problem, which requires ad-hoc methods to fulfill the engineering requirements. In this work, we introduce the Mesh Adaptive Basin Hopping algorithm to tackle such problem effectively; the experimental results show that the new approach proposed outperforms the state-of-the-art methods, both in terms of quality of the solutions and computational efficiency.

Suggested Citation

  • Giovanni Stracquadanio & Elisa Pappalardo & Panos M. Pardalos, 2012. "A Mesh Adaptive Basin Hopping Method for the Design of Circular Antenna Arrays," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 1008-1024, December.
    • Handle: RePEc:spr:joptap:v:155:y:2012:i:3:d:10.1007_s10957-012-0112-8
    DOI: 10.1007/s10957-012-0112-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0112-8
    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/s10957-012-0112-8?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. Andrea Grosso & Marco Locatelli & Fabio Schoen, 2009. "Solving molecular distance geometry problems by global optimization algorithms," Computational Optimization and Applications, Springer, vol. 43(1), pages 23-37, May.
    2. Charles Audet & J. Dennis & Sébastien Digabel, 2010. "Globalization strategies for Mesh Adaptive Direct Search," Computational Optimization and Applications, Springer, vol. 46(2), pages 193-215, June.
    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. Tommaso Giovannelli & Giampaolo Liuzzi & Stefano Lucidi & Francesco Rinaldi, 2022. "Derivative-free methods for mixed-integer nonsmooth constrained optimization," Computational Optimization and Applications, Springer, vol. 82(2), pages 293-327, June.
    2. Carlile Lavor & Leo Liberti & Nelson Maculan & Antonio Mucherino, 2012. "The discretizable molecular distance geometry problem," Computational Optimization and Applications, Springer, vol. 52(1), pages 115-146, May.
    3. Jiyuan Zhang & Bin Zhang & Shiqian Xu & Qihong Feng & Xianmin Zhang & Derek Elsworth, 2021. "Interpretation of Gas/Water Relative Permeability of Coal Using the Hybrid Bayesian-Assisted History Matching: New Insights," Energies, MDPI, vol. 14(3), pages 1-19, January.
    4. Moody Chu & Matthew Lin & Liqi Wang, 2014. "A study of singular spectrum analysis with global optimization techniques," Journal of Global Optimization, Springer, vol. 60(3), pages 551-574, November.
    5. W. L. Hare & Y. Lucet, 2014. "Derivative-Free Optimization Via Proximal Point Methods," Journal of Optimization Theory and Applications, Springer, vol. 160(1), pages 204-220, January.
    6. 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.
    7. J. Martínez & F. Sobral, 2013. "Constrained derivative-free optimization on thin domains," Journal of Global Optimization, Springer, vol. 56(3), pages 1217-1232, July.
    8. Xin-long Luo & Zhi-jun Wu, 2011. "Least-Squares Approximations in Geometric Buildup for Solving Distance Geometry Problems," Journal of Optimization Theory and Applications, Springer, vol. 149(3), pages 580-598, June.
    9. Charles Audet & Andrew R. Conn & Sébastien Le Digabel & Mathilde Peyrega, 2018. "A progressive barrier derivative-free trust-region algorithm for constrained optimization," Computational Optimization and Applications, Springer, vol. 71(2), pages 307-329, November.

    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:joptap:v:155:y:2012:i:3:d:10.1007_s10957-012-0112-8. 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.