Skip to main content
SpringerLink
Log in

Stochastic comparison algorithm for continuous optimization with estimation

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

The problem of stochastic optimization for arbitrary objective functions presents a dual challenge. First, one needs to repeatedly estimate the objective function; when no closed-form expression is available, this is only possible through simulation. Second, one has to face the possibility of determining local, rather than global, optima. In this paper, we show how the stochastic comparison approach recently proposed in Ref. 1 for discrete optimization can be used in continuous optimization. We prove that the continuous stochastic comparison algorithm converges to an ∈-neighborhood of the global optimum for any ∈>0. Several applications of this approach to problems with different features are provided and compared to simulated annealing and gradient descent algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gong, W. B., Ho, Y. C., andZhai, W.,Stochastic Comparison Algorithm for Discrete Optimization with Estimation, Proceedings of the 31st IEEE Conference on Decision and Control, pp. 795–802, 1992.

  2. Torn, A., andZilinskas, A.,Global Optimization, Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany, 1987.

    Google Scholar 

  3. Goldberg, D. E.,Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Publishing Company, Reading, Massachusetts, 1989.

    Google Scholar 

  4. Aarts, E., andKorst, J.,Simulated Annealing and Boltzmann Machines, John Wiley and Sons, New York, New York, 1989.

    Google Scholar 

  5. Johnson, D. S., Aragon, C. R., McGeoch, L. A., andSchevon, C.,Optimization by Simulated Annealing: An Experimental Evaluation, Part 1: Graph Partitioning, Operations Research, Vol. 37, pp. 865–892, 1989.

    Google Scholar 

  6. Yan, D., andMukai, H.,Stochastic Discrete Optimization, SIAM Journal on Control and Optimization, Vol. 30, pp. 549–612, 1992.

    Article  Google Scholar 

  7. Ho, Y. C., andCao, X. R.,Perturbation Analysis of Discrete-Event Dynamic Systems, Kluwer Academic Publishers, Dordrecht, Netherlands, 1991.

    Google Scholar 

  8. Glasserman, P.,Gradient Estimation via Perturbation Analysis, Kluwer Academic Publishers, Dordrecht, Netherlands, 1991.

    Google Scholar 

  9. Glynn, P. W.,Likelihood Ratio Gradient Estimation: An Overview, Proceedings of the 1987 Winter Simulation Conference, pp. 336–375, 1987.

  10. Reiman, M., andWeiss, A.,Sensitivity Analysis for Simulations via Likelihood Ratios, Operations Research, Vol. 37, pp. 830–844, 1989.

    Google Scholar 

  11. Rubinstein, R. Y.,Sensitivity Analysis and Performance Extrapolation for Computer Simulation Models, Operations Research, Vol. 37, pp. 72–81, 1989.

    Google Scholar 

  12. Hertz, J., Krogh, A., andPalmer, R. G.,Introduction to the Theory of Neural Computing, Addison-Wesley Publishing Company, Reading, Massachusetts, 1991.

    Google Scholar 

  13. Gelfand, S. B., andMitter, S. K.,Simulated Annealing with Noisy or Imprecise Energy Measurements, Journal of Optimization Theory and Applications, Vol. 62, pp. 49–62, 1989.

    Article  Google Scholar 

  14. Isaacson, D. L., andMadsen, R. W.,Markow Chains: Theory and Applications, John Wiley and Sons, New York, New York, 1976.

    Google Scholar 

  15. Ho, Y. C., Sreenivas, R., andVakili, P.,Ordinal Optimization of Discrete-Event Dynamic Systems, Journal of Discrete Event Dynamic Systems, Vol. 2, pp. 61–88, 1992.

    Article  Google Scholar 

  16. Bao, G., andCassandras, C. G.,Stochastic Comparison Algorithm: Theory and Applications, Technical Report, Department of Electrical and Computer Engineering, University of Massachusetts, 1995.

  17. Gong, W. B.,Smoothed Perturbation Analysis Algorithm for a G/G/1 Routing Problem, Proceedings of the 1988 Winter Simulation Conference, pp. 525–531, 1988.

  18. Chong, E. K. P., andRamadge, P. J.,Convergence of Recursive Optimization Algorithms Using Infinitesimal Perturbation Analysis Estimates, Journal of Discrete Event Dynamic Systems, Vol. 1, pp. 339–372, 1992.

    Google Scholar 

  19. Mohanty, B., andCassandras, C. G.,The Effect of Model Uncertainty on Some Optimal Routing Problems, Journal of Optimization Theory and Applications, Vol. 77, pp. 257–290, 1993.

    Article  Google Scholar 

  20. Bertsekas, D. P., andGallager, R. G.,Data Networks, Prentice Hall, Englewood Cliffs, New Jersey, 1987.

    Google Scholar 

Download references

Author information

Author notes

  1. G. Bao (Graduate Student)

    Present address: Qualcomm Incorporated, San Diego, California

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, Massachusetts

    G. Bao (Graduate Student) & C. G. Cassandras (Professor)

Authors
  1. G. Bao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. G. Cassandras
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Y. C. Ho

This work was supported in part by the National Science Foundation under Grants EID-92-12122 and ECS-88-01912, and by a Grant from United Technologies/Otis Elevator Company.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bao, G., Cassandras, C.G. Stochastic comparison algorithm for continuous optimization with estimation. J Optim Theory Appl 91, 585–615 (1996). https://doi.org/10.1007/BF02190123

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02190123

Key Words

Search

Navigation