A filled function method dominated by filter for nonlinearly global optimization. (English) Zbl 1435.90133

Summary: This work presents a filled function method based on the filter technique for global optimization. Filled function method is one of the effective methods for nonlinear global optimization, since it can effectively find a better minimizer. Filter technique is applied to local optimization methods for its excellent numerical results. In order to optimize the filled function method, the filter method is employed for global optimizations in this method. A new filled function is proposed first, and then the algorithm and its properties are proved. The numerical results are listed at the end.


90C30 Nonlinear programming
65K05 Numerical mathematical programming methods
90C26 Nonconvex programming, global optimization
Full Text: DOI


[1] Ge, R. P.; Qin, Y. F., A class of filled functions for finding global minimizers of a function of several variables, Journal of Optimization Theory and Applications, 54, 2, 241-252, (1987) · Zbl 0595.65072
[2] Ge, R. P.; Qin, Y. F., The globally convexized filled functions for global optimization, Applied Mathematics and Computation, 35, 2, 131-158, (1990) · Zbl 0752.65052
[3] Zhang, L.-S.; Ng, C.-K.; Li, D.; Tian, W.-W., A new filled function method for global optimization, Journal of Global Optimization, 28, 1, 17-43, (2004) · Zbl 1061.90109
[4] Wang, W.; Xu, Y., Simple transformation functions for finding better minima, Applied Mathematics Letters, 21, 5, 502-509, (2008) · Zbl 1144.90492
[5] Liang, Y. M.; Zhang, L. S.; Li, M. M.; Han, B. S., A filled function method for global optimization, Journal of Computational and Applied Mathematics, 205, 1, 16-31, (2007) · Zbl 1124.65052
[6] Lin, H.; Wang, Y.; Fan, L.; Gao, Y., A new discrete filled function method for finding global minimizer of the integer programming, Applied Mathematics and Computation, 219, 9, 4371-4378, (2013) · Zbl 1401.90127
[7] Ling, B. W.; Wu, C. Z.; Teo, K. L.; Rehbock, V., Global optimal design of IIR filters via constraint transcription and filled function methods, Circuits, Systems, and Signal Processing, 32, 3, 1313-1334, (2013)
[8] Fletcher, R.; Leyffer, S., Nonlinear programming without a penalty function, Mathematical Programming, 91, 2, 239-269, (2002) · Zbl 1049.90088
[9] Fletcher, R.; Leyffer, S.; Toint, P. L., On the global convergence of a filter-SQP algorithm, SIAM Journal on Optimization, 13, 1, 44-59, (2002) · Zbl 1029.65063
[10] Wachter, A.; Biegler, L. T., Line search filter methods for nonlinear programming: local convergence, SIAM Journal on Optimization, 16, 1, 32-48, (2005) · Zbl 1115.90056
[11] Wang, W.; Hua, S.; Tang, J., A generalized gradient projection filter algorithm for inequality constrained optimization, Journal of Applied Mathematics, 2013, (2013) · Zbl 1397.90366
[12] Wang, C. J.; Luo, R. H.; Wu, K.; Han, B. S., A new filled function method for an unconstrained nonlinear equation, Journal of Computational and Applied Mathematics, 235, 6, 1689-1699, (2011) · Zbl 1213.65077
[13] Wu, Z. Y.; Bai, F. S.; Li, G. Q.; Yang, Y. J., A new auxiliary function method for systems of nonlinear equations, Journal of Industrial and Management Optimization, 11, 2, 345-364, (2015) · Zbl 1304.90165
[14] Floudas, C. A.; Pardalos, P. M.; Adjiman, C. S., Handbook of Test Problems in Local and Global Optimization, (1999), Dordrecht, The Netherlands: Kluwer Academic Publishers, Dordrecht, The Netherlands · Zbl 0943.90001
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.