×

Finding global minima with a filled function approach for non-smooth global optimization. (English) Zbl 1189.49024

Summary: A filled function approach is proposed for solving a non-smooth unconstrained global optimization problem. First, the definition of filled function in Zhang (2009) for smooth global optimization is extended to non-smooth case and a new one is put forwarded. Then, a novel filled function is proposed for non-smooth the global optimization and a corresponding non-smooth algorithm based on the filled function is designed. At last, a numerical test is made. The computational results demonstrate that the proposed approach is effcient and reliable.

MSC:

49J52 Nonsmooth analysis
49M30 Other numerical methods in calculus of variations (MSC2010)
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] DOI: 10.1007/BF01585737 · Zbl 0694.90083
[2] DOI: 10.1016/S0377-0427(00)00425-8 · Zbl 0969.90067
[3] Nonconvex Optimization and Its Applications 62 pp viii+569– (2002)
[4] Nonconvex Optimization and Its Applications 2 pp xviii+880– (1995)
[5] DOI: 10.1023/A:1011207512894
[6] DOI: 10.1016/j.amc.2005.04.046 · Zbl 1094.65063
[7] DOI: 10.1016/j.amc.2005.05.009 · Zbl 1120.90042
[8] DOI: 10.1023/B:JOGO.0000006653.60256.f6 · Zbl 1061.90109
[9] Mathematica Applicata 17 (2) pp 36– (2004)
[10] Journal of Chongqing 26 (1) pp 1– (2009)
[11] (1990)
[12] Advanced Modeling and Optimization 11 (1) pp 43– (2009)
[13] DOI: 10.1137/040603371 · Zbl 1112.90078
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.