ε-OPTIMAL SOLUTION FOR CONTINUOUS MINIMAX PROBLEMS WITH MAXIMUM-ENTROPY FUNCTION

This paper describes and explores a maximum-entropy approach to continuous minimax problem, which is applicable in many fields, such as transportation planning and game theory. It illustrates that the maximum entropy approcach has easy framework and proves that every accumulation of {x_k} generated by maximum-entropy programming is -optimal solution of initial continuous minimax problem. The paper also explains BFGS or TR method for it. Two numerical exam.ples for continuous minimax problem are given     

Ishikawa Iterative Process in Uniformly Smooth Banach Spaces

ＬｅｔＥｂｅａｕｎｉｆｏｒｍｌｙｓｍｏｏｔｈＢａｎａｃｈｓｐａｃｅ ,ＫｂｅａｎｏｎｅｍｐｔｙｃｌｏｓｅｄｃｏｎｖｅｘｓｕｂｓｅｔｏｆＥ ,ａｎｄｓｕｐｐｏｓｅＴ :Ｋ→ＫｉｓａｃｏｎｔｉｎｕｏｕｓΦ＿ｓｔｒｏｎｇｌｙｐｓｅｕｄｏｃｏｎｔｒａｃｔｉｖｅｏｐｅｒａｔｏｒ.ＤｅｎｏｔｅｔｈｅｄｕａｌｓｐａｃｅｏｆＥｂｙＥ .ＷｅｄｅｎｏｔｅｂｙＪｔｈｅｄｕａｌｉｔｙｍａｐｆｒｏｍＥｔｏ 2 Ｅ ｄｅｆｉｎｅｄｂｙＪ(ｘ) =ｆ∈Ｅ :〈ｘ ,ｆ〉=‖ｘ‖2 =‖ｆ‖2 . ( 1 )Ｉｔｉｓｗｅｌｌ＿ｋｎｏｗｎｔｈａｔｉｆＥｉｓｕ…     

关于一致光滑Banch空间中的Ishikawa迭代

设E为一致光滑Banach空间,K为E的非空闭凸子集,T：K→K为具有有界值域的连续φ－强伪压缩算子。使用新的分析技巧证明了在非常普遍的条件下,Ishikawa迭代序列{xn}强收敛于T的唯一不动点x^*。改进和扩展了近期许多相关的结果。