IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v66y2017i3d10.1007_s10589-016-9875-4.html
   My bibliography  Save this article

Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization

Author

Listed:
  • K. Lakshmanan

    (Amrita School of Engineering)

  • Shalabh Bhatnagar

    (Indian Institute of Science)

Abstract

We propose a multi-time scale quasi-Newton based smoothed functional (QN-SF) algorithm for stochastic optimization both with and without inequality constraints. The algorithm combines the smoothed functional (SF) scheme for estimating the gradient with the quasi-Newton method to solve the optimization problem. Newton algorithms typically update the Hessian at each instant and subsequently (a) project them to the space of positive definite and symmetric matrices, and (b) invert the projected Hessian. The latter operation is computationally expensive. In order to save computational effort, we propose in this paper a quasi-Newton SF (QN-SF) algorithm based on the Broyden-Fletcher-Goldfarb-Shanno (BFGS) update rule. In Bhatnagar (ACM TModel Comput S. 18(1): 27–62, 2007), a Jacobi variant of Newton SF (JN-SF) was proposed and implemented to save computational effort. We compare our QN-SF algorithm with gradient SF (G-SF) and JN-SF algorithms on two different problems – first on a simple stochastic function minimization problem and the other on a problem of optimal routing in a queueing network. We observe from the experiments that the QN-SF algorithm performs significantly better than both G-SF and JN-SF algorithms on both the problem settings. Next we extend the QN-SF algorithm to the case of constrained optimization. In this case too, the QN-SF algorithm performs much better than the JN-SF algorithm. Finally we present the proof of convergence for the QN-SF algorithm in both unconstrained and constrained settings.

Suggested Citation

  • K. Lakshmanan & Shalabh Bhatnagar, 2017. "Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization," Computational Optimization and Applications, Springer, vol. 66(3), pages 533-556, April.
    • Handle: RePEc:spr:coopap:v:66:y:2017:i:3:d:10.1007_s10589-016-9875-4
    DOI: 10.1007/s10589-016-9875-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10589-016-9875-4
    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/s10589-016-9875-4?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. Sigrún Andradöttir, 1996. "A Scaled Stochastic Approximation Algorithm," Management Science, INFORMS, vol. 42(4), pages 475-498, April.
    2. 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.
    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. Chen, Shih-Pin, 2007. "Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method," European Journal of Operational Research, Elsevier, vol. 177(1), pages 445-457, February.
    2. Shekhar, Chandra & Kumar, Amit & Varshney, Shreekant, 2020. "Load sharing redundant repairable systems with switching and reboot delay," Reliability Engineering and System Safety, Elsevier, vol. 193(C).
    3. Nataša Krejić & Nataša Krklec Jerinkić, 2019. "Spectral projected gradient method for stochastic optimization," Journal of Global Optimization, Springer, vol. 73(1), pages 59-81, January.
    4. Kabirian, Alireza & Ólafsson, Sigurdur, 2011. "Continuous optimization via simulation using Golden Region search," European Journal of Operational Research, Elsevier, vol. 208(1), pages 19-27, January.
    5. Bettonvil, Bert & del Castillo, Enrique & Kleijnen, Jack P.C., 2009. "Statistical testing of optimality conditions in multiresponse simulation-based optimization," European Journal of Operational Research, Elsevier, vol. 199(2), pages 448-458, December.
    6. Bettonvil, B.W.M. & Del Castillo, E. & Kleijnen, J.P.C., 2007. "Statistical Testing of Optimality Conditions in Multiresponse Simulation-based Optimization (Revision of 2005-81)," Other publications TiSEM 3e563d88-0029-47f6-a66b-e, Tilburg University, School of Economics and Management.
    7. 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.
    8. 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.
    9. Arsham H., 1998. "Techniques for Monte Carlo Optimizing," Monte Carlo Methods and Applications, De Gruyter, vol. 4(3), pages 181-230, December.
    10. Chen, Shih-Pin, 2016. "Time value of delays in unreliable production systems with mixed uncertainties of fuzziness and randomness," European Journal of Operational Research, Elsevier, vol. 255(3), pages 834-844.
    11. Nicolai, R.P. & Koning, A.J., 2006. "A general framework for statistical inference on discrete event systems," Econometric Institute Research Papers EI 2006-45, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    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:coopap:v:66:y:2017:i:3:d:10.1007_s10589-016-9875-4. 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.