IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v111y2001i2d10.1023_a1011986402461.html
   My bibliography  Save this article

Minimization Algorithms Based on Supervisor and Searcher Cooperation

Author

Listed:
  • W. Liu

    (University of Kent)

  • Y. H. Dai

    (Chinese Academy of Sciences)

Abstract

In the present work, we explore a general framework for the design of new minimization algorithms with desirable characteristics, namely, supervisor-searcher cooperation. We propose a class of algorithms within this framework and examine a gradient algorithm in the class. Global convergence is established for the deterministic case in the absence of noise and the convergence rate is studied. Both theoretical analysis and numerical tests show that the algorithm is efficient for the deterministic case. Furthermore, the fact that there is no line search procedure incorporated in the algorithm seems to strengthen its robustness so that it tackles effectively test problems with stronger stochastic noises. The numerical results for both deterministic and stochastic test problems illustrate the appealing attributes of the algorithm.

Suggested Citation

  • W. Liu & Y. H. Dai, 2001. "Minimization Algorithms Based on Supervisor and Searcher Cooperation," Journal of Optimization Theory and Applications, Springer, vol. 111(2), pages 359-379, November.
    • Handle: RePEc:spr:joptap:v:111:y:2001:i:2:d:10.1023_a:1011986402461
    DOI: 10.1023/A:1011986402461
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1011986402461
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1011986402461?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. Russell R. Barton & John S. Ivey, Jr., 1996. "Nelder-Mead Simplex Modifications for Simulation Optimization," Management Science, INFORMS, vol. 42(7), pages 954-973, July.
    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. Zhitao Xu & Li Gao, 2019. "The Uzawa-MBB type algorithm for nonsymmetric saddle point problems," Computational Optimization and Applications, Springer, vol. 73(3), pages 933-956, July.
    2. K. Sirlantzis & J. D. Lamb & W. B. Liu, 2006. "Novel Algorithms for Noisy Minimization Problems with Applications to Neural Networks Training," Journal of Optimization Theory and Applications, Springer, vol. 129(2), pages 325-340, May.
    3. Zhong-bao Wang & Xue Chen & Jiang Yi & Zhang-you Chen, 2022. "Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities," Journal of Global Optimization, Springer, vol. 82(3), pages 499-522, March.

    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. David J. Eckman & Shane G. Henderson & Sara Shashaani, 2023. "Diagnostic Tools for Evaluating and Comparing Simulation-Optimization Algorithms," INFORMS Journal on Computing, INFORMS, vol. 35(2), pages 350-367, March.
    2. Satyajith Amaran & Nikolaos V. Sahinidis & Bikram Sharda & Scott J. Bury, 2016. "Simulation optimization: a review of algorithms and applications," Annals of Operations Research, Springer, vol. 240(1), pages 351-380, May.
    3. Sudarshan Kumar & Tiziana Di Matteo & Anindya S. Chakrabarti, 2020. "Disentangling shock diffusion on complex networks: Identification through graph planarity," Papers 2001.01518, arXiv.org.
    4. Rosen, Scott L. & Harmonosky, Catherine M. & Traband, Mark T., 2007. "A simulation optimization method that considers uncertainty and multiple performance measures," European Journal of Operational Research, Elsevier, vol. 181(1), pages 315-330, August.
    5. David G. Humphrey & James R. Wilson, 2000. "A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 272-283, November.
    6. Alkhamis, Talal M. & Ahmed, Mohamed A., 2006. "A modified Hooke and Jeeves algorithm with likelihood ratio performance extrapolation for simulation optimization," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1802-1815, November.
    7. Fan, Shu-Kai S. & Zahara, Erwie, 2007. "A hybrid simplex search and particle swarm optimization for unconstrained optimization," European Journal of Operational Research, Elsevier, vol. 181(2), pages 527-548, September.
    8. Hachicha, Wafik & Ammeri, Ahmed & Masmoudi, Faouzi & Chachoub, Habib, 2010. "A comprehensive literature classification of simulation optimisation methods," MPRA Paper 27652, University Library of Munich, Germany.
    9. Ozden, Mufit & Ho, Yu-Chi, 2003. "A probabilistic solution-generator for simulation," European Journal of Operational Research, Elsevier, vol. 146(1), pages 35-51, April.
    10. Chang, Kuo-Hao, 2015. "A direct search method for unconstrained quantile-based simulation optimization," European Journal of Operational Research, Elsevier, vol. 246(2), pages 487-495.
    11. Neddermeijer, H.G. & Piersma, N. & van Oortmarssen, G.J. & Habbema, J.D.F. & Dekker, R., 1999. "Comparison of response surface methodology and the Nelder and Mead simplex method for optimization in microsimulation models," Econometric Institute Research Papers EI 9924-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    12. Galip Altinay, 2003. "Estimating growth rate in the presence of serially correlated errors," Applied Economics Letters, Taylor & Francis Journals, vol. 10(15), pages 967-970.
    13. Chang, Kuo-Hao, 2012. "Stochastic Nelder–Mead simplex method – A new globally convergent direct search method for simulation optimization," European Journal of Operational Research, Elsevier, vol. 220(3), pages 684-694.
    14. Kao, Chiang & Chen, Shih-Pin, 2006. "A stochastic quasi-Newton method for simulation response optimization," European Journal of Operational Research, Elsevier, vol. 173(1), pages 30-46, August.
    15. M Laguna & J Molina & F Pérez & R Caballero & A G Hernández-Díaz, 2010. "The challenge of optimizing expensive black boxes: a scatter search/rough set theory approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 53-67, January.
    16. Kuo-Hao Chang & L. Jeff Hong & Hong Wan, 2013. "Stochastic Trust-Region Response-Surface Method (STRONG)---A New Response-Surface Framework for Simulation Optimization," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 230-243, May.
    17. Cheung, Ka Chun & He, Wanting & Wang, He, 2023. "Multi-constrained optimal reinsurance model from the duality perspectives," Insurance: Mathematics and Economics, Elsevier, vol. 113(C), pages 199-214.
    18. Arsham H., 1998. "Techniques for Monte Carlo Optimizing," Monte Carlo Methods and Applications, De Gruyter, vol. 4(3), pages 181-230, December.
    19. Pinto, Roberto, 2016. "Stock rationing under a profit satisficing objective," Omega, Elsevier, vol. 65(C), pages 55-68.
    20. Jeroen J. van den Broek & Nicolien T. van Ravesteyn & Eveline A. Heijnsdijk & Harry J. de Koning, 2018. "Simulating the Impact of Risk-Based Screening and Treatment on Breast Cancer Outcomes with MISCAN-Fadia," Medical Decision Making, , vol. 38(1_suppl), pages 54-65, April.

    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:111:y:2001:i:2:d:10.1023_a:1011986402461. 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.