极小极大问题的非单调滤子算法  

A nonmonotone filter method for minimax problems

作　　者：赵奇[1] 张燕[1] 

机构地区：[1]江苏科技大学张家港校区基础部,江苏张家港215600

出　　处：《运筹学学报》2012年第2期91-104,共14页Operations Research Transactions

基　　金：国家自然科学基金(No.10201026)

摘　　要：提出一种改进的求解极小极大问题的信赖域滤子方法,利用SQP子问题来求一个试探步,用滤子来衡量是否接受试探步,避免了罚函数的使用;并且借用已有文献的思想,使用了Lagrange函数作为效益函数和非单调技术,在适当的条件下,分析了算法的全局和局部收敛性,并进行了数值实验.In this paper,we present a modified trust-region filter algorithm to solve the unconstrained minimax problem.The algorithm solves an SQP subproblem to acquire the attempted step.The filter technique is used to weigh the effect of the attempted step so as to avoid the use of a penalty function.Based on the idea of the latest reference, we use the Lagrange function as a merit function,also combine it with the nonmonotone technique to improve the effect of the algorithm.Under some mild conditions,we prove the global convergence and superlinear local convergence.Numerical results show the effectiveness of the algorithm.

关 键 词：极小极大问题 非单调 全局收敛性 滤子算法 超线性收敛 

分 类 号：O221[理学—运筹学与控制论]