Skip to main content

Learning Probability Densities of Optimization Problems with Constraints and Uncertainty

  • Conference paper
  • 2042 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5317))

Abstract

A recently introduced method for the learning of the asymptotic marginal densities of stochastic search processes in optimization is generalized for its application in problems under constraints and uncertainty. The use of the proposed approach as a mechanism for diversification in optimization algorithms is illustrated on several benchmark examples.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Michalewicz, Z.: A survey of constraint handling techniques in evolutionary computation methods. In: Proc. of the 4th Annual Conf. on Evolutionary Programming, pp. 135–155. MIT Press, Cambridge (1995)

    Google Scholar 

  2. Berrones, A.: Generating Random Deviates Consistent with the Long Term Behavior of Stochastic Search Processes in Global Optimization. In: Sandoval, F., Gonzalez Prieto, A., Cabestany, J., Graña, M. (eds.) IWANN 2007. LNCS, vol. 4507, pp. 1–8. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Berrones, A.: Stationary probability density of stochastic search processes in global optimization. J. Stat. Mech., P01013 (2008)

    Google Scholar 

  4. Peña, D., Sánchez, R., Berrones, A.: Stationary Fokker–Planck Learning for the Optimization of Parameters in Nonlinear Models. In: Gelbukh, A., Kuri Morales, Á.F. (eds.) MICAI 2007. LNCS (LNAI), vol. 4827, pp. 94–104. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Risken, H.: The Fokker–Planck Equation. Springer, Berlin (1984)

    MATH  Google Scholar 

  6. Van Kampen, N.G.: Stochastic Processes in Physics and Chemistry. North-Holland, Amsterdam (1992)

    MATH  Google Scholar 

  7. Osyczka, A., Krenich, S.: Evolutionary Algorithms for Global Optimization. In: Pintér, J. (ed.) Global Optimization, Scientific and Engineering Case Studies Series: Nonconvex Optimization and Its Applications, vol. 85 (2006)

    Google Scholar 

  8. Pulido, G.T., Coello, C.A.C.: A constraint-handling mechanism for particle swarm optimization. In: Proceedings of the 2004 congress on evolutionary computation, vol. 2, pp. 1396–1403 (2004)

    Google Scholar 

  9. Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, Berlin (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Velasco, J., Muñiz, A.L., Berrones, A. (2008). Learning Probability Densities of Optimization Problems with Constraints and Uncertainty. In: Gelbukh, A., Morales, E.F. (eds) MICAI 2008: Advances in Artificial Intelligence. MICAI 2008. Lecture Notes in Computer Science(), vol 5317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88636-5_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88636-5_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88635-8

  • Online ISBN: 978-3-540-88636-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics