Skip to main content
Springer Nature Link
Log in

A one-parameter filled function for nonsmooth global optimization and its application

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper presents a modified definition of the filled function for finding a global minimizer of a nonsmooth function on a closed bounded set, and then give a one-parameter filled function. Theoretical and numerical properties of the proposed filled function are investigated and a corresponding solution algorithm is proposed. The proposed filled function’s parameter is easier to be appropriately chosen than previous functions in literatures. Numerical results obtained indicate the efficiency of the proposed filled function method. An improved fingerprint recognition method using global filled function is also reported.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Y. Q. Qu, Y. M. Jiang, and D. R. He, Fruit nutritive factor network, Journal of Systems Science & Complexity, 2009, 22(1): 150–158.

    Article  MATH  Google Scholar 

  2. F. J. Chen, Exponential stability of delayed cellular neural networks, Journal of Zhejiang Normal University (Natural Sciences), 2007, 30(1): 34–38.

    MATH  Google Scholar 

  3. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing, Science, 1983, 220: 671–680.

    Article  MathSciNet  Google Scholar 

  4. R. Horst, Deterministic methods in constrained global optimization: Some recent advances and new fields of application, Naval Research Logistics, 1990, 37: 433–471.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. V. Levy and A. Montalvo, The tunneling algorithm for the global minimization of functions, SIAM Journal on Scientific and Statistical Computing, 1985, 6: 15–29.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. P. Ge, The theory of filled function methods for finding global minimizers of nonlinearly constrained minimization problems, Journal of Computational Mathematics, 1987, 5: 1–9.

    Google Scholar 

  7. R. P. Ge and Y. F. Qin, The globally convexized filled functions for global optimization, Applied Mathematics and Computation, 1990, 35: 131–158.

    Article  MATH  MathSciNet  Google Scholar 

  8. Q. M. Han and J. Y. Han, Revised filled function methods for global optimization, Applied Mathematics and Computation, 2001, 119: 217–228.

    Article  MATH  MathSciNet  Google Scholar 

  9. L. S. Zhang, C. K. Ng, D. Li, and W. W. Tian, A new filled function method for global optimization, Journal of Global Optimization, 2004, 28: 17–43.

    Article  MATH  MathSciNet  Google Scholar 

  10. L. S. Zhang and D. Li, Global search in nonlinear integer programming: Filled function approach, Proceedings of the 4th International Conference on Optimization: Techniques and Applications, 1998, 1: 446–452.

    Google Scholar 

  11. N. Shor, Minimization Methods for Non-Differentiable Function, Springer-verlag, Berlin, 1985.

    Google Scholar 

  12. E. Cheney and A. Goldstein, Newton’s methods for convex programming and tchebycheff approximations, Numerische Mathematik, 1959, 1: 253–268.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. E. Kelley, The cutting-plane method for solving convex programs, Journal of the Society for Industrial and Applied Mathematics, 1960, 8: 703–712.

    Article  MathSciNet  Google Scholar 

  14. J. L. Goffin, A. Haurie, and J. P. Vial, Decomposition and nondifferentiable optimization with the projective algorithm, Management Science, 1992, 38: 284–302.

    Article  MATH  Google Scholar 

  15. J. B. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithms, Grundlehren Der Mathematischen Wissenschaften, Springer-Verlag, Berlin, 1993.

    Google Scholar 

  16. H. Schramm and J. A. Zowe, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM Journal on Optimization, 1992, 2: 121–152.

    Article  MATH  MathSciNet  Google Scholar 

  17. Y. F. Yang and D. H. Li, A trust region algorithm for constrained nonsmooth optimization problem, Journal of Computational Mathematics, 2001, 19: 357–364.

    MATH  Google Scholar 

  18. J. Zowe, The BT-algorithm for minimizing a nonsmooth functional subject to linear constrains, Nonsmooth Optimization and Related Topics, Plenum Press, New York, 1989.

    Google Scholar 

  19. F. H. Clarke, Optimization and Nonsmooth Analysis, John Wiley and Sons, New York, 1983.

    MATH  Google Scholar 

  20. G. Bebis, T. Deaconu, and M. Georgiopoulos, Fingerprint identification using Delaunay triangulation, Proceedings of International Conference on Information Intelligence and Systems, 1999, 452–459.

  21. Y. Pan, S. Shu, and Q. Zhang, A algorithm about fingerprint recognition based on BP neural network, Journal of Shaoyang University (Natural Science Edition), 2007, 4: 54–57.

    Google Scholar 

  22. J. Y. Fan, An Approach to fault diagnosis of chemical processes via neural networks, Journal of AICHE, 1993, 39: 82–87.

    Article  Google Scholar 

  23. N. P. Hu and L. Wang, The improved neural network algorithm in character recognition, Automatization and Apparatus Instrument, 2006, 16: 12–13.

    Google Scholar 

  24. F. J. Chen, Exponential stability of delayed cellular neural networks, Journal of Zhejiang Normal University (Natural Sciences), 2007, 30: 34–38.

    MATH  Google Scholar 

  25. Z. H. Shen and Y. Zhu, An interval version of shubert’s iterative method for the localization of the global maximum, Computing, 1987, 38: 275–280.

    Article  MATH  MathSciNet  Google Scholar 

  26. C. Gorges and H. Ratschek, Global interval methods for local nonsmooth optimization, Journal of Global Optimization, 1999, 14: 157–179.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang Normal University, Jinhua, 321004, China

    Ying Zhang & Yingtao Xu

  2. Department of Mathematics, Shanghai University, Shanghai, 200444, China

    Liansheng Zhang

Authors
  1. Ying Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liansheng Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yingtao Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ying Zhang.

Additional information

This research is supported by the National Natural Science Foundation of China under Grant No. 11001248.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Y., Zhang, L. & Xu, Y. A one-parameter filled function for nonsmooth global optimization and its application. J Syst Sci Complex 23, 1195–1209 (2010). https://doi.org/10.1007/s11424-010-7199-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-010-7199-5

Key words