Toward A geometric theory of minimax equalities

We present new ideas and concepts in minimax equalities. Two important classes of multifunctions will be singled out, the Weak Passy-Prisman multifunctions and multifunctions possessing the finite simplex property. To each class of multifunctions corresponds a class of functions. We obtain necessary and sufficient conditions for a multifunction to have the finite intersection property, and necessary and sufficient conditions for a function to be a minimax function. All our results specialize to sharp improvements of known theorems, Sion, Tuy, Passy-Prisman, Flåm-Greco. One feature of our approach is that no topology is required on the space of the maximization variable. In a previous paper [6] we presented a “method of reconstruction of polytopes” from a given family of subsets, this in turn lead to a “principle of reconstruction of convex sets” Theorem 3, which plays a major role in this paper. Our intersection theorems bear no obvious relationship to other results of the same kind, like K.K.M. or other more elementary approaches based on connectedness. We conclude our work with a remark on the role of upper and lower semicontinuous regularization in mimmax equalities     

Star-shaped approximation approach for stochastic programming problems with probability function

Star-shaped probability function approximation is suggested. Conditions of log-concavity and differentiability of approximation function are obtained. The method for constructing stochastic estimates of approximation function gradient and stochastic quasi-gradient algorithm for probability function maximization are described in the paper     

Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization

In this paper, we present a family of secant algorithms in association with nonmonotone trust region strategy for nonlinear equality constrained optimization problems. The proposed algorithms are globally convergent while keeping the local superlinear rate by introducing Fletcher's penalty function as merit function.     

集值上鞅可Doob分解的条件

假定(X,‖·‖)为实Banach空间,X*为其对偶空间,X*可分.给出了集值上鞅几种不同的Doob分解概念,利用支撑函数研究了集值上鞅在各种分解意义下可Doob分解的充分必要条件.     

求解一类模糊线性微分系统的结构元方法

基于模糊结构元方法,研究了由对称模糊结构元线性生成的一般模糊线性微分系统和双重的一般模糊线性微分系统,给出了模糊线性微分系统解存在的充要条件,得到了结构元线性生成的齐次、非齐次以及双重一般模糊线性微分系统求解方法。最后,给出了这类系统的实际应用。     

基于模糊综合评判法的保密风险定量评估

根据保密工作现状和实际情况,针对保密风险的的特点,分析了其相关影响因素,建立了保密风险评估的指标体系,给出了评估指标的量化处理方法,并对评价指标进行了无量纲化处理．在此基础上,提出了保密风险的模糊综合评估模型,划分了保密风险的5类等级．     

区间值信息系统基于极大相容类的属性约简

区间值信息系统是单值信息系统的一种广义模型,通过引入变精度相容关系以及极大变精度相容类,提出区间值信息系统的属性约简与对象的相对属性约简.进一步,基于区分矩阵,定义一种区分函数与相对区分函数,得到计算区间值信息系统上属性约简与相对约简的具体操作方法.     

基于综合函数设计的模糊系统及其插值机理

分析现有模糊系统的数学表示形式,注意到模糊系统输出函数的构造常采用对规则后件模糊集峰点(中心)值加权平均的方法. 综合函数是因素空间理论中利用简单因素状态合成复杂因素状态的有效工具, 本文将综合函数用于构造规则后件模糊集峰点(中心)值的权重, 给出一种新的模糊系统设计方法, 并且证明了这种基于综合函数的模糊系统可归结为一种插值函数.     

Indecomposable and noncrossed product division algebras over function fields of smooth p-adic curves

We construct indecomposable and noncrossed product division algebras over function fields of connected smooth curves X over Zp. This is done by defining an index preserving morphism which splits , where is the completion of K(X) at the special fiber, and using it to lift indecomposable and noncrossed product division algebras over .     

The Carlitz shtuka

Recently we have used the Carlitz exponential map to define a finitely generated submodule of the Carlitz module having the right properties to be a function field analogue of the group of units in a number field. Similarly, we constructed a finite module analogous to the class group of a number field. In this short note more algebraic constructions of these “unit” and “class” modules are given and they are related to Ext modules in the category of shtukas.