IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v128y2006i3d10.1007_s10957-006-9040-9.html
   My bibliography  Save this article

Backtracking Adaptive Search: Distribution of Number of Iterations to Convergence

Author

Listed:
  • G. R. Wood

    (Macquarie University)

  • D. W. Bulger

    (Macquarie University)

  • W. P. Baritompa

    (University of Canterbury)

  • D. L. J. Alexander

    (Massey University)

Abstract

Backtracking adaptive search is a simplified stochastic optimiza-tion procedure which permits the acceptance of worsening objective function values. It generalizes the hesitant adaptive search, which in turn is a gener-alization of the pure adaptive search. In this paper, we use ideas from the theory of stochastic processes to determine the full distribution of the number of iterations to convergence for the backtracking adaptive search.

Suggested Citation

  • G. R. Wood & D. W. Bulger & W. P. Baritompa & D. L. J. Alexander, 2006. "Backtracking Adaptive Search: Distribution of Number of Iterations to Convergence," Journal of Optimization Theory and Applications, Springer, vol. 128(3), pages 547-562, March.
    • Handle: RePEc:spr:joptap:v:128:y:2006:i:3:d:10.1007_s10957-006-9040-9
    DOI: 10.1007/s10957-006-9040-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-006-9040-9
    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-006-9040-9?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. D. Bulger & W. P. Baritompa & G. R. Wood, 2003. "Implementing Pure Adaptive Search with Grover's Quantum Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 517-529, March.
    2. M. Locatelli, 2001. "Convergence and first hitting time of simulated annealing algorithms for continuous global optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 54(2), pages 171-199, December.
    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. Zelda B. Zabinsky & David D. Linz, 2023. "Hesitant adaptive search with estimation and quantile adaptive search for global optimization with noise," Journal of Global Optimization, Springer, vol. 87(1), pages 31-55, September.

    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. Rubenthaler, Sylvain & Rydén, Tobias & Wiktorsson, Magnus, 2009. "Fast simulated annealing in with an application to maximum likelihood estimation in state-space models," Stochastic Processes and their Applications, Elsevier, vol. 119(6), pages 1912-1931, June.
    2. Weitao Sun & Yuan Dong, 2011. "Study of multiscale global optimization based on parameter space partition," Journal of Global Optimization, Springer, vol. 49(1), pages 149-172, January.
    3. Liu, Yipeng & Koehler, Gary J., 2010. "Using modifications to Grover's Search algorithm for quantum global optimization," European Journal of Operational Research, Elsevier, vol. 207(2), pages 620-632, December.
    4. Yipeng Liu & Gary Koehler, 2012. "A hybrid method for quantum global optimization," Journal of Global Optimization, Springer, vol. 52(3), pages 607-626, March.
    5. Zheng Peng & Donghua Wu & Wenxing Zhu, 2016. "The robust constant and its applications in random global search for unconstrained global optimization," Journal of Global Optimization, Springer, vol. 64(3), pages 469-482, March.
    6. Benjamin Lev, 2005. "Book Reviews," Interfaces, INFORMS, vol. 35(4), pages 339-345, August.
    7. Dawid Tarłowski, 2017. "On the convergence rate issues of general Markov search for global minimum," Journal of Global Optimization, Springer, vol. 69(4), pages 869-888, December.
    8. Coelho, Leandro dos Santos, 2008. "A quantum particle swarm optimizer with chaotic mutation operator," Chaos, Solitons & Fractals, Elsevier, vol. 37(5), pages 1409-1418.
    9. Dylan Herman & Cody Googin & Xiaoyuan Liu & Alexey Galda & Ilya Safro & Yue Sun & Marco Pistoia & Yuri Alexeev, 2022. "A Survey of Quantum Computing for Finance," Papers 2201.02773, arXiv.org, revised Jun 2022.
    10. Alok Shukla & Prakash Vedula, 2019. "Trajectory optimization using quantum computing," Journal of Global Optimization, Springer, vol. 75(1), pages 199-225, September.
    11. D. W. Bulger, 2007. "Combining a Local Search and Grover’s Algorithm in Black-Box Global Optimization," Journal of Optimization Theory and Applications, Springer, vol. 133(3), pages 289-301, June.

    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:128:y:2006:i:3:d:10.1007_s10957-006-9040-9. 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.