半无限规划问题的SQP算法及全局收敛性分析  

The SQP Algorithm and Global Convergence Analysis of Semi-infinite Programming Problem

作　　者：吴磊[1] WU Lei(Faculty of Mathematic Science,Baotou Teachers College,Baotou 014030)

机构地区：[1]包头师范学院数学科学学院,内蒙古包头014030

出　　处：《阴山学刊（自然科学版）》2018年第4期14-16,共3页Yinshan Academic Journal(Natural Science Edition)

基　　金：包头师范学院青年科学研究基金项目(BSYKJ2015-20)

摘　　要：本文通过将半无限规划问题的不等式约束条件等价地转化为等式约束条件问题,针对转化后含松弛因子的二次规划问题提出SQP算法并证明在一定条件下算法具有全局收敛性.The inequality constraint conditions of semi -infinite programming problem is converted to questions with equality constraint conditions equivalently in this paper. The SQP slgorithm of quadratic programming problem with the relaxation factor after the conversion is put forward and the algorithm is proved global convergence under certain contains.

关 键 词：半无限规划 SQP算法 全局收敛 

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