An Interval Maximum Entropy Method for Quadratic Programming Problem
With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the maximum entropy function, provide the region deletion test rules and design an interval maximum entropy algorithm for quadratic programming problem. The convergence of the method is proved and numerical results are presented. Both theoretical and numerical results show that the method is reliable and efficient.
作 者： RUI Wen-juan CAO De-xin SONG Xie-wu 作者单位： School of Sciences,China University of Mining & Technology,Xuzhou ,Jiangsu 221008,China 刊 名： 中国矿业大学学报（英文版） ISTIC EI 英文刊名： JOURNAL OF CHINA UNIVERSITY OF MINING & TECHNOLOGY 年，卷(期)： 2005 15(4) 分类号： O242.29 O221.2 关键词： quadratic programming interval algorithm penalty function maximum entropy function