无界域二次规划问题的区间算法  

An Interval Algorithm for Quadratic Programming in Unbounded Domains

作　　者：杨东[1] 芮文娟[2] 

机构地区：[1]中国电信徐州分公司,江苏徐州221000 [2]中国矿业大学理学院,江苏徐州221000

出　　处：《上海第二工业大学学报》2014年第3期239-244,共6页Journal of Shanghai Polytechnic University

基　　金：中央高校基本科研业务费专项资金(No.2013QNA33)资助

摘　　要：利用罚函数将无界域二次规划问题转化为无约束优化问题,讨论了罚函数的区间扩张,利用Moore二分法与无解区域的删除原则,给出了求解无界域二次规划问题的区间算法。理论分析和实例计算均表明算法是可靠和有效的。By using the penalty function, the quadratic programming problems in unbounded domain are transferred to unconstrained optimization problems. The interval extension of penalty function is discussed. With no deletion of principle based on Moore dichotomy, the interval algorithm for solving quadratic programming problems in unbounded domain is established. Theory analysis and example calculation show that the algorithm is reliable and efficient.

关 键 词：二次规划 区间算法 罚函数 

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