IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v124y2005i2d10.1007_s10957-004-0948-7.html
   My bibliography  Save this article

Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms

Author

Listed:
  • Ya. D. Sergeyev

    (Università della Calabria, University of Nizhni Novgorod)

Abstract

In this paper, the problem of the minimal description of the structure of a vector function f(x) over an N-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x) at only one point within each subinterval are considered. Two partition strategies traditionally used for solving this problem are analyzed. A new partition strategy based on an efficient technique developed for diagonal algorithms is proposed and studied.

Suggested Citation

  • Ya. D. Sergeyev, 2005. "Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 124(2), pages 503-510, February.
    • Handle: RePEc:spr:joptap:v:124:y:2005:i:2:d:10.1007_s10957-004-0948-7
    DOI: 10.1007/s10957-004-0948-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-004-0948-7
    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-004-0948-7?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. YA. D. Sergeyev, 2000. "Efficient Strategy for Adaptive Partition of N-Dimensional Intervals in the Framework of Diagonal Algorithms," Journal of Optimization Theory and Applications, Springer, vol. 107(1), pages 145-168, October.
    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. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.

    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. Remigijus Paulavičius & Lakhdar Chiter & Julius Žilinskas, 2018. "Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants," Journal of Global Optimization, Springer, vol. 71(1), pages 5-20, May.
    2. Donald R. Jones & Joaquim R. R. A. Martins, 2021. "The DIRECT algorithm: 25 years Later," Journal of Global Optimization, Springer, vol. 79(3), pages 521-566, March.
    3. Remigijus Paulavičius & Yaroslav Sergeyev & Dmitri Kvasov & Julius Žilinskas, 2014. "Globally-biased Disimpl algorithm for expensive global optimization," Journal of Global Optimization, Springer, vol. 59(2), pages 545-567, July.
    4. Albertas Gimbutas & Antanas Žilinskas, 2018. "An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section," Journal of Global Optimization, Springer, vol. 71(1), pages 115-127, May.

    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:124:y:2005:i:2:d:10.1007_s10957-004-0948-7. 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.