【摘要】 提出了一种新的精确光滑罚函数求解带约束的极大极小问题.仅仅添加一个额外的变量,利用这个精确光滑罚函数,将带约束的极大极小问题转化为无约束优化问题.证明了在合理的假设条件下,当罚参数充分大,罚问题的极小值点就是原问题的极小值点.进一步,研究了局部精确性质.数值结果表明这种罚函数算法是求解带约束有限极大极小问题的一种有效算法.更多还原

【Abstract】 A new exact yet smooth penalty function to tackle constrained min-max problems was introduced.Using this new penalty function and adding just one extra variable,a constrained min-max problem was transformed into an unconstrained optimization one.It was proved that,under certain reasonable assumptions and when the penalty parameter was sufficiently large,the minimizer of this unconstrained optimization problem was equivalent to the minimizer of the original constrained one.Moreover,the local exactness property was also studied.The numerical results demonstrate that this penalty function method is an effective and promising approach for solving constrained finite min-max problems.更多还原