Skip to main content

The Robust Constant and Its Applications in Global Optimization

  • Conference paper
  • First Online:
Advances in Global Optimization

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 95))

  • 2113 Accesses

Abstract

Robust analysis is important for designing and analyzing algorithm for global optimization. In this paper, we introduced a new concept, robust constant, to quantitatively characterize robustness of measurable sets and measurable functions. The new concept is consistent with the robustness proposed in literature. This paper also showed that robust constant had significant value in the analysis of some random search algorithms for solving global optimization problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. Vavasis, S.A.: Complexity issues in global optimization: a survey. In: Handbook of Global Optimization, pp. 27–41. Kluwer, Dordrecht (1995)

    Google Scholar 

  2. Schoen, F.: Stochastic techniques for global optimization: a survey of recent advances. J. Glob. Optim. 1(3), 207–228 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  3. Floudas, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Optim. 45(1), 3–38 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. Pardalos, P.M., Romeijn, H.E., Tuy, H.: Recent developments and trends in global optimization. J. Comput. Appl. Math. 124, 209–228 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Thomas, W.: Global optimization algorithms—theory and application (2008). Online available at http://www.it-weise.de/

  6. Brooks, S.H.: A discussion of random methods for seeking maxima. Oper. Res. 6, 244–251 (1958)

    Article  MathSciNet  Google Scholar 

  7. Appel, M.J., Labarre, R., Radulovic, D.: On accelerated random search. SIAM J. Optim. 14, 708–731 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kabirian, A.: Hybrid probabilistic search methods for simulation optimization. J. Ind. Syst. Eng. 2(4), 259–270 (2009)

    Google Scholar 

  9. Radulovia, D.: Pure random search with exponential rate of convergency. Optimization 59(2), 289–303 (2010)

    Article  MathSciNet  Google Scholar 

  10. Zabinsky, Z.B., Smith, R.L.: Pure adaptive search in global optimization. Math. Program. 53, 323–338 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Chew, S., Zheng, Q.: Integral Global Optimization (Theory, Implementation and Applications). Springer, Berlin (1988)

    Book  MATH  Google Scholar 

  12. Zheng, Q., Zhuang, D.M.: Integral global minimization: algorithms, implementations and numerical tests. J. Glob. Optim. 7, 421–454 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  13. Yao, Y.R., Chen, L., Zheng, Q.: Optimality condition and algorithm with deviation integral for global optimization. J. Math. Anal. Appl. 357(2), 371–384 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Peng, Z., Wu, D., Zheng, Q.: A level-value estimation method and stochastic implementation for global optimization. J. Optim. Theory Appl. 156(2), 493–523 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  15. Peng, Z., Shen, Y., Wu, D.: A modified integral global optimization method and its asymptotic convergence. Acta Math. Appl. Sin. 25(2), 283–290 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  16. Rubinstein, R.Y.: The cross-entropy method for combinatorial and continuous optimization. Methodol. Comput. Appl. Probab. 2, 127–190 (1999)

    Article  Google Scholar 

  17. De Boer, P.T., Kroese, D.P., et al.: A tutorial on the cross-entropy method. Ann. Oper. Res. 134, 19–67 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Kroese, D.P., Porotsky, S., Rubinstein, R.Y.: The cross-entropy method for continuous multi-extremal optimization. Methodol. Comput. Appl. Probab. 8, 383–407 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  19. Zheng, Q.: Robust analysis and global optimization. Ann. Oper. Res. 24, 273–286 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is supported by Natural Science Foundation of China (61170308), Natural Science Foundation of FuJian Province (2011J01008) and the talent foundation of Fuzhou University (XRC-1043).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Wenxing Zhu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Peng, Z., Wu, D., Zhu, W. (2015). The Robust Constant and Its Applications in Global Optimization. In: Gao, D., Ruan, N., Xing, W. (eds) Advances in Global Optimization. Springer Proceedings in Mathematics & Statistics, vol 95. Springer, Cham. https://doi.org/10.1007/978-3-319-08377-3_45

Download citation

Publish with us

Policies and ethics