Skip to main content

The Theories of a Novel Filled Function Method for Non-smooth Global Optimization

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2020)

Abstract

This paper proposes a novel filled function method for non-smooth box constrained global optimization. The constructed filled function contains two parameters, which could be easily adjusted during the process of terations. The theoretical and numerical properties of the filled function are studied, and a filled function algorithm is given. Finally, several numerical results, including the application of the filled function method in solving nonlinear equations, are reported.

Supported by organization National Natural Science Foundation of China (No. 11471102), Basic research projects for key scientific research projects in Henan Province (No. 20ZX001).

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

References

  1. Ge, R.P., Qin, Y.F.: A class of filled functions for finding a global minimizer of a function of several variables. J. Optim. Theory Appl. 54(2), 241–252 (1987)

    Article  MathSciNet  Google Scholar 

  2. Zhang, L.S., Ng, C.K., Li, D.: A new filled function method for global optimization. J. Glob. Optim. 28, 17–43 (2004)

    Article  MathSciNet  Google Scholar 

  3. Xu, Z., Huang, H.X., Pardalos, P.M., Xu, C.X.: Filled functions for unconstrained global optimization. J. Glob. Optim. 20, 49–65 (2001)

    Article  MathSciNet  Google Scholar 

  4. Wu, Z.Y., Zhang, L.S., Teo, K.L., Bai, F.S.: New modified function for global optimization. J. Optim. Theory Appl. 125(1), 181–203 (2005)

    Article  MathSciNet  Google Scholar 

  5. Wu, Z.Y., Li, D., Zhang, L.S.: Global descent methods for unconstrained global optimization. J. Glob. Optim. 50, 379–396 (2011)

    Article  MathSciNet  Google Scholar 

  6. Yang, Y.J., Shang, Y.L.: A new filled function method for unconstrained global optimization. Appl. Math. Comput. 173, 501–512 (2006)

    MathSciNet  MATH  Google Scholar 

  7. Audet, C., Dennis, Jr., J.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17, 188–217 (2006)

    Google Scholar 

  8. Price, C.J., Robertson, B.L., Reale, M.: A hybrid Hooke and Jeeves - direct method for non-smooth optimization. Adv. Model. Optim. 11(1), 43–61 (2009)

    MathSciNet  MATH  Google Scholar 

  9. Clarke, F.H.: Optimization and Non-smooth Analysis. Wiley, New York (1983)

    Google Scholar 

Download references

Acknowledgement

This work was supported by the NNSF of China (No. 11001248, 11001248, 51776116).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to You-lin Shang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wang, Wx., Shang, Yl., Li, S. (2020). The Theories of a Novel Filled Function Method for Non-smooth Global Optimization. In: Zhang, Z., Li, W., Du, DZ. (eds) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science(), vol 12290. Springer, Cham. https://doi.org/10.1007/978-3-030-57602-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-57602-8_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-57601-1

  • Online ISBN: 978-3-030-57602-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics