上海第二工业大学学报
上海第二工業大學學報
상해제이공업대학학보
JOURNAL OF SHANGHAI SECOND POLYTECHNIC UNIVERSITY
2009年
4期
280-285
,共6页
约束优化问题%罚信赖域算法%光滑近似技术
約束優化問題%罰信賴域算法%光滑近似技術
약속우화문제%벌신뢰역산법%광활근사기술
constrained optimization%penalty trust-region method%smooth approximate technique
很多现实的优化问题都能描述成一个约束优化问题.目前,已有很多经典的方法用来解决这类问题,其中尤以罚函数法最受青睐.本文中,提出了一种新的罚信赖域算法.新算法构造了两个光滑函数用来近似罚函数,并结合了信赖域算法.最后也对算法收敛性做了一些讨论.
很多現實的優化問題都能描述成一箇約束優化問題.目前,已有很多經典的方法用來解決這類問題,其中尤以罰函數法最受青睞.本文中,提齣瞭一種新的罰信賴域算法.新算法構造瞭兩箇光滑函數用來近似罰函數,併結閤瞭信賴域算法.最後也對算法收斂性做瞭一些討論.
흔다현실적우화문제도능묘술성일개약속우화문제.목전,이유흔다경전적방법용래해결저류문제,기중우이벌함수법최수청래.본문중,제출료일충신적벌신뢰역산법.신산법구조료량개광활함수용래근사벌함수,병결합료신뢰역산법.최후야대산법수렴성주료일사토론.
Many real-world search and optimization problems can be formulated as constrained problems. In trying to solve them, a lot of classical methods have be developed, in which penalty function methods are the most popular. This paper presents a new penalty trust region method with a smooth approximate technique for constrained problems. The approximate technique uses two new smooth functions to deal with the problem that the original functions are not differentiable at the origin point. Several convergence results are also discussed.