IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v422y2022ics009630032200056x.html
   My bibliography  Save this article

Development of modal interval algorithm for solving continuous minimax problems

Author

Listed:
  • Luo, Xin
  • Sun, Min

Abstract

While there are a large variety of effective methods developed for solving more traditional minimization problems, much less success has been reported in solving the minimax problem minu∈Umaxv∈Vf(u,v) where U×V is a fixed interval domain in Rn. Most of the existing work deal with a discrete V or even a finite V. Continuous minimax problems can be applied to engineering, finance, and other fields. Sainz in 2008 proposed a modal interval algorithm based on their semantic extensions to solve continuous minimax problems. We developed an improved algorithm using modal intervals to solve unconstrained continuous minimax problems. A new interval method is introduced by taking advantage of both the original minimax problem and its dual problem. After theoretical analysis of major issues, the new algorithm is implemented in the framework of uniform partition of the search domain. Various improvement techniques including more bisecting choices, sampling methods, and deletion conditions are applied to make the new method more powerful. Preliminary numerical results provide promising evidence of its effectiveness.

Suggested Citation

  • Luo, Xin & Sun, Min, 2022. "Development of modal interval algorithm for solving continuous minimax problems," Applied Mathematics and Computation, Elsevier, vol. 422(C).
    • Handle: RePEc:eee:apmaco:v:422:y:2022:i:c:s009630032200056x
    DOI: 10.1016/j.amc.2022.126970
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S009630032200056X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2022.126970?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. P. Parpas & B. Rustem, 2009. "An Algorithm for the Global Optimization of a Class of Continuous Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 141(2), pages 461-473, May.
    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. Li Wang & Feng Guo, 2014. "Semidefinite relaxations for semi-infinite polynomial programming," Computational Optimization and Applications, Springer, vol. 58(1), pages 133-159, May.
    2. J. Lasserre, 2011. "Min-max and robust polynomial optimization," Journal of Global Optimization, Springer, vol. 51(1), pages 1-10, September.
    3. Yu, Shui & Wu, Xiao & Zhao, Dongyu & Li, Yun, 2024. "A two-level surrogate framework for demand-objective time-variant reliability-based design optimization," Reliability Engineering and System Safety, Elsevier, vol. 244(C).
    4. J. Lasserre, 2012. "An algorithm for semi-infinite polynomial optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 119-129, April.
    5. Feng Guo & Xiaoxia Sun, 2020. "On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems," Computational Optimization and Applications, Springer, vol. 75(3), pages 669-699, April.
    6. Julien Marzat & Eric Walter & Hélène Piet-Lahanier, 2013. "Worst-case global optimization of black-box functions through Kriging and relaxation," Journal of Global Optimization, Springer, vol. 55(4), pages 707-727, April.
    7. Olga Kostyukova & Tatiana Tchemisova, 2017. "Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 76-103, October.
    8. Feng Guo & Liguo Jiao, 2021. "On solving a class of fractional semi-infinite polynomial programming problems," Computational Optimization and Applications, Springer, vol. 80(2), pages 439-481, 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:eee:apmaco:v:422:y:2022:i:c:s009630032200056x. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.