Skip to main content
Springer Nature Link
Log in

A New Class of Filled Functions for Global Minimization

  • Conference paper
Computational Intelligence and Security (CIS 2005)

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

Included in the following conference series:

Abstract

Filled function method is a type of efficient methods to solve global optimization problems arisen in non-convex programming. In this paper, a new class of filled functions is proposed. This class of filled functions has only one adjustable parameter a. Several examples of this class of filled functions with specified parameter values are given, which contain the filled functions proposed in [3] and [4]. These examples show this class of filled functions contains more simple functions, therefore this class of filled functions have better computability. An algorithm employing the proposed filled function is presented, and numerical experiments show that the proposed filled functions are efficient.

Key project supported by National Nature Science Foundation of China:10231060.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Renpu, G.: A filled function method for finding global minimizer of a function of several variables. Mathematical programming 46, 191–204 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ge, R.P., Qin, Y.F.: A class of filled functions for finding a global minimizer of a function of several variables. Journal of optimization theory and applications 54, 241–252 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Liu, X.: Finding global minima with a computable filled function. Journal of global optimization 19, 151–161 (2001)

    Article  MATH  Google Scholar 

  4. Liu, X., Xu, W.: A new filled function applied to global optimization. Computer and Operation Research 31, 61–80 (2004)

    Article  Google Scholar 

  5. Xu, Z., Huang, H., Panos, M.P., Xu, C.: Filled functions for unconstrained global optimization. Journal of global optimization 20, 49–65 (2001)

    Article  MATH  Google Scholar 

  6. Ge, R.P., Qin, Y.F.: The globally convexized filled functions for globally optimization. Applied mathematics and computations 35, 131–158 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kong, M., Zhuang, J.N.: A modified filled function method for finding a global minimizer of a non-smooth funciton of several variables. Numerical mathematics-A journal of chinese universities 18(2), 165–174 (1996)

    MATH  MathSciNet  Google Scholar 

  8. Zhang, L.-S., Ng, C.-K., Li, D., Tian, W.-w.: A new filled function methord for global optimization. Journal of global optimization 28, 17–43 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Xi’an Jiaotong University, Xi’an, 710049, China

    Xiaoliang He, Chengxian Xu & Chuanchao Zhu

Authors
  1. Xiaoliang He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chengxian Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chuanchao Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microelectronic Instiute, Xidian University, 710071, Xi’an, China

    Yue Hao

  2. Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong

    Jiming Liu

  3. School of Computer Science and Technology, Xidian University, Xi’an, China

    Yuping Wang

  4. Department of Computer Science, Hong Kong Baptist University, Hong Kong,  

    Yiu-ming Cheung

  5. School of Electrical and Electronic Engineering, University of Manchester, UK

    Hujun Yin

  6. Life Science Research Center, School of Electronic Engineering, Xidian University, 710071, Xi’an, Shaanxi, China

    Licheng Jiao

  7. Key Laboratory of Computer Networks and Information Security (Ministry of Education), Xidian University, 710071, Xi’an, China

    Jianfeng Ma

  8. National Laboratory of Antennas and Microwave Technology, Xidian University, 710071, Xi’an, Shanxi, P.R. China

    Yong-Chang Jiao

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

He, X., Xu, C., Zhu, C. (2005). A New Class of Filled Functions for Global Minimization. In: Hao, Y., et al. Computational Intelligence and Security. CIS 2005. Lecture Notes in Computer Science(), vol 3801. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596448_162

Download citation

  • DOI: https://doi.org/10.1007/11596448_162

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics