惩罚法
数学优化
序列(生物学)
约束优化
最优化问题
约束(计算机辅助设计)
连续优化
功能(生物学)
数学
约束优化问题
计算机科学
应用数学
多群优化
生物
进化生物学
遗传学
几何学
作者
Changjun Yu,Kok Lay Teo,Liansheng Zhang,Yanqin Bai
标识
DOI:10.3934/jimo.2010.6.895
摘要
In this paper, a computational approach based on a new exact penaltyfunction method is devised for solving a class of continuousinequality constrained optimization problems. The continuousinequality constraints are first approximated by smooth function inintegral form. Then, we construct a new exact penalty function,where the summation of all these approximate smooth functions inintegral form, called the constraint violation, is appended to theobjective function. In this way, we obtain a sequence of approximateunconstrained optimization problems. It is shown that if the valueof the penalty parameter is sufficiently large, then any localminimizer of the corresponding unconstrained optimization problem isa local minimizer of the original problem. For illustration, threeexamples are solved using the proposed method. From the solutionsobtained, we observe that the values of their objective functionsare amongst the smallest when compared with those obtained by otherexisting methods available in the literature. More importantly, ourmethod finds solution which satisfies the continuous inequalityconstraints.
科研通智能强力驱动
Strongly Powered by AbleSci AI