半无限规划基于离散化方法和局部约化的两个算法框架（英文）  

TWO ALGORITHM FRAMEWORKS BASED ON DISCRETIZATION METHOD AND LOCAL REDUCTION FOR SEMI-INFINITE PROGRAMMING

作　　者：徐庆娟 简金宝 XU Qing-juan;JIAN Jin-bao(College of Mathematical and Statistics Sciences,Guangxi Teachers Education University,Nanning 530001,China;College of Science,Guangxi University for Nationalities,Nanning 530006,China)

机构地区：[1]广西师范学院数学与统计科学学院,广西南宁530001 [2]广西民族大学理学院,广西南宁530006

出　　处：《数学杂志》2018年第5期851-860,共10页Journal of Mathematics

基　　金：Supported by National Natural Science Foundation of China(11271086);Guangxi Natural Science Foundation(2014GXNSFBA118002);Guangxi Colleges and Universities Key Laboratory of Data Science(Guangxi Teachers Education University)

摘　　要：本文研究了求解半无限规划的两个算法框架.利用离散化方法和局部约化方法,提出了两个求解半无限规划的算法框架.在温和的条件下,证明了基于离散化方法的算法框架具有弱全局收敛性.数值试验表明所提出的算法框架是有效的.In this paper,two algorithm frameworks for semi-infinite programming(SIP)are discussed.Using discretization method and local reduction method,we present two algorithm frameworks for SIP.Under some mild assumptions,the algorithm framework based on discretiza-tion method possesses weak global convergence.Numerical experiments show that the proposed algorithm frameworks are effective.

关 键 词：半无限规划 离散化方法 局部约化 全局收敛性 

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