Indexed by:
Abstract:
This paper considers the nonlinearly constrained continuous global minimization problem. Based on the idea of the penalty function method, an auxiliary function. which has approximately the same global minimizers as the original problem, is constructed. An algorithm is developed to minimize the auxiliary function to find an approximate constrained global minimizer of the constrained global minimization problem. The algorithm can escape from the previously converged local minimizers, and can converge to an approximate global minimizer of the problem asymptotically with probability one. Numerical experiments show that it is better than some other well known recent methods for constrained global minimization problems. (C) 2008 Elsevier B.V. All rights reserved.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
ISSN: 0377-0427
Year: 2009
Issue: 2
Volume: 230
Page: 491-503
1 . 2 9 2
JCR@2009
2 . 1 0 0
JCR@2023
ESI Discipline: MATHEMATICS;
JCR Journal Grade:1
CAS Journal Grade:1
Cited Count:
WoS CC Cited Count: 13
SCOPUS Cited Count: 21
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 1
Affiliated Colleges: