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  刊 名： 中國礦業(yè)大學學報（英文版）  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  

【An Interval Maximum Entropy Method f】相關文章：

Adjoint method for the optimum planning of industrial pollutant sources04-26

Knowledge Fusion Design Method: Satellite Module Layout04-26

Eigenvector Method for Ranking Alternatives with Vague Value Measurements04-27

A stochastic method for convective storm identification,tracking and nowcasting04-26

《m f》教案02-23

學科術語 F05-04

F/A- 18E/F機翼突然失速研究04-26

Combined Method of Chaotic Theory and Neural Networks for Water Quality Prediction04-26

Track reconstruction using the TSF method for the BESⅢ main drift chamber04-27

A method of extending DPIV and its application in spray droplet size measurements04-27