首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Solving nonlinearly constrained global optimization problem via an auxiliary function method
Authors:Wenxing Zhu  MM Ali
Institution:aCenter for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou 350002, China;bSchool of Computational and Applied Mathematics, University of the Witwatersrand, Wits 2050, Johannesburg, South Africa
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.
Keywords:Nonlinearly constrained global minimization problem  Auxiliary function method  Convergence
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号