摘要
A novel filled function is suggested in this paper for identifying a global minimum point for a general class of nonlinear programming problems with a closed bounded domain. Theoretical and numerical properties of the proposed filled function are investigated and a solution algorithm is proposed. The implementation of the algorithm on several test problems is reported with satisfactory numerical results.
| 源语言 | 英语 |
|---|---|
| 页（从-至） | 17-43 |
| 页数 | 27 |
| 期刊 | Journal of Global Optimization |
| 卷 | 28 |
| 期 | 1 |
| DOI | |
| 出版状态 | 已出版 - 1月 2004 |
| 已对外发布 | 是 |