共查询到20条相似文献,搜索用时 109 毫秒
1.
一类约束不可微优化问题的区间极大熵方法 总被引:23,自引:0,他引:23
本文研究求解不等式约束离散minimax问题的区间算法,其中目标函数和约束函数是 C~1类函数.利用罚函数法和极大熵函数思想将问题转化为无约束可微优化问题,讨论了极大熵函数的区间扩张,证明了收敛性等性质,提出了无解区域删除原则,建立了区间极大熵算法,并给出了数值算例.该算法是收敛、可靠和有效的. 相似文献
2.
基于Tsallis熵和非对称熵,本文提出了Tsallis型非对称熵,该熵推广了Tsallis熵和非对称熵,证明了最大的Tsallis型非对称熵原理,并且从该原理中可以获得比Tsallis熵及非对称熵原理更多的分布,从而说明该原理的有用性. 相似文献
3.
提出了参数型指数模糊熵公式.本文首先将Pal提出的指数模糊熵公式进行修改并得到了参数型指数模糊熵公式,其次对其合理性进行了证明,最后探讨了参数型指数模糊熵公式所具有的性质. 相似文献
4.
5.
本文将熵函数的思想和区间分析相结合,构造了一类线性规划问题的区间调节熵算法,讨论了调节熵函数的区间扩张及其收敛阶,以及相关的区域删除检验原则,证明了算法的收敛性,给出了数值算例.理论与数值结果表明该方法是可靠和有效的. 相似文献
6.
7.
最小熵反褶积是分解非高斯线性随机过程的方法之一,本文提出了系统响应序列峰度的概念和研究了它的性质,并借助它建立了最小褶反褶积的收敛理论,本文首次研究了多维非高斯线性随机过程的最小熵反褶积问题并建立了相应的收敛理论,本文还讨论了最小熵反褶积方法与参数方法的关系。 相似文献
8.
在煤矿突发事故初期,时间的紧迫性和环境的复杂性导致应急救援决策中的评估信息存在不确定性,传统基于确数的决策方法难以适用,对此本文提出了一种基于直觉模糊软集(IFSSs)的煤矿应急救援决策方法。首先对现有IFSSs熵公理化定义中的不合理之处进行修正,进而据此构造新的IFSSs熵计算公式,并通过与既有IFSSs熵公式的对比算例表现了新公式的合理性和有效性。然后基于新熵公式给出属性综合权重的确定方法,再利用推广的TOPSIS方法对预案进行排序以确定最优煤矿应急救援预案。最后将本文提出的方法应用于某煤矿应急救援实例。结果表明,基于IFSSs的煤矿应急救援决策方法能充分利用和有效处理不确定性的信息,具有更好的决策分辨效果,可以为煤矿突发事故的应急救援提供决策支持。 相似文献
9.
本文构造了求解无约束非线性lp问题的新方法——调节熵函数法。给出了数值算法,证明了算法的收敛性。通过数值仿真将该方法与求解无约束非线性lp问题的极大熵函数法进行了比较,表明该算法是十分有效的。 相似文献
10.
11.
12.
在获得损失分布不完全信息情况下,提出用方差和熵共同度量损失风险的方法.在不完全信息条件下,通过最大熵原理在最不确定的情况下得到最大熵损失分布,并获得了损失分布的熵函数值.用熵值度量损失分布对于均匀分布的离散程度,从而度量概率波动带来的风险;用方差度量损失对于均值的离散程度,从而度量状态波动带来的风险.由于熵是与损失变量更高阶矩信息相联系的,所以新方法是从更全面的角度对损失风险的预测.通过算例,进一步看出在获得高阶矩信息下,熵参与风险度量的必要性. 相似文献
13.
一类无约束离散Minimax问题的区间调节熵算法 总被引:3,自引:0,他引:3
LiSubei CaoDexin WangHaijun DengKazhong 《高校应用数学学报(英文版)》2004,19(1):37-43
In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C^1. The paper deals with this problem by means of taking the place of maximum-entropy function with adjustable entropy function. By constructing an interval extension of adjustable entropy function and some region deletion test rules, a new interval algorithm is presented. The relevant properties are proven, The minimax value and the localization of the minimax points of the problem can be obtained by this method. This method can overcome the flow problem in the maximum-entropy algorithm. Both theoretical and numerical results show that the method is reliable and efficient. 相似文献
14.
15.
16.
《Mathematical and Computer Modelling》1995,21(1-2):143-157
In this paper, we propose a method of entropy minimization for increasing selectivity and obtaining simple network architectures. An entropy function is defined with respect to the state of hidden units. By minimizing this entropy, the selectivity of hidden units can significantly be increased. Since a unit tends to respond to specific input patterns, the meaning or the function of the hidden units can easily be understood. In addition, we have observed that by minimizing the entropy, some units are forced to be inactive, responding to no input patterns. Thus, these inactive units can be deleted, and we can construct smaller network architectures. We applied the entropy method to standard and recurrent back-propagation. Experimental results confirmed that the number of units selectively responding to a specific pattern increased gradually, while units with low selectivity responding to multiple patterns decreased as entropy decreased. In addition, the number of units responding to no input patterns increased in proportion to the decrease of the entropy. These results show that the entropy minimization method can be used to improve the selectivity, and therefore, the interpretability of the network's behaviors. Then, the method can be used to suppress unnecessary units and to produce simple internal representation or simple network architectures. 相似文献
17.
Jan Eriksson 《Mathematical Programming》1980,18(1):146-154
This paper describes a method to solve large sparse maximum entropy problems with linear equality constraints using Newtons and the conjugate gradient method. A numerical example is given to introduce the reader to possible applications of entropy models and this method. Some experience from large scale problems is also reported. 相似文献
18.
We present a streamline diffusion shock capturing spacetime discontinuous Galerkin (DG) method to approximate nonlinear systems of conservation laws in several space dimensions. The degrees of freedom are in terms of the entropy variables and the numerical flux functions are the entropy stable finite volume fluxes. We show entropy stability of the (formally) arbitrarily high order accurate method for a general system of conservation laws. Furthermore, we prove that the approximate solutions converge to the entropy measure valued solutions for nonlinear systems of conservation laws. Convergence to entropy solutions for scalar conservation laws and for linear symmetrizable systems is also shown. Numerical experiments are presented to illustrate the robustness of the proposed schemes. 相似文献
19.
20.
平衡规划问题的熵函数方法及其在混合交通流中的应用 总被引:1,自引:0,他引:1
将参变极值问题的极大熵函数方法应用到求解平衡规划问题中,通过先验分布信息和Kullback熵概念,给出了平衡规划问题基于Kullback熵表示的熵函数求解方法,并将平衡规划的极大熵函数方法应用于求解混合交通平衡分配问题. 相似文献