摘要
The filled function method is an effective approach to find a global minimizer. In this paper, based on a new definition of the filled function for nonsmooth constrained programming problems, a one-parameter filled function is constructed to improve the efficiency of numerical computation. Then a corresponding algorithm is presented. It is a global optimization method which modify the objective function as a filled function, and which find a better local minimizer gradually by optimizing the filled function constructed on the minimizer previously found. Illustrative examples are provided to demonstrate the efficiency and reliability of the proposed filled function method.
| 源语言 | 英语 |
|---|---|
| 页（从-至） | 415-426 |
| 页数 | 12 |
| 期刊 | Journal of Computational and Applied Mathematics |
| 卷 | 232 |
| 期 | 2 |
| DOI | |
| 出版状态 | 已出版 - 15 10月 2009 |
| 已对外发布 | 是 |
指纹
探究 'A filled function method applied to nonsmooth constrained global optimization' 的科研主题。它们共同构成独一无二的指纹。引用此
Zhang, Y., Xu, Y., & Zhang, L. (2009). A filled function method applied to nonsmooth constrained global optimization. Journal of Computational and Applied Mathematics, 232(2), 415-426. https://doi.org/10.1016/j.cam.2009.06.020