集值向量优化的二阶最优性必要条件

在赋范空间中给出了集值映射的二阶切集的概念,利用二阶切集,定义了集值映射的二阶切导数。然后,获得了集值向量优化问题弱极小元的两个二阶最优性必要条件。     

Copula的局部变结构点诊断的实证研究

基于Copula函数对相关性研究的特有优势,构建了二元正态Copula模型,提出了在时变相关系数的基础上对局部变结构点的诊断方法.以上证煤炭指数及有色金属指数作为实证样本,研究了煤炭指数和有色金属的相关性发生显著变化的时刻,并分析其变化原因.本文的研究结果能更敏锐地捕捉金融市场的动向和指导风险投资.     

具变系数和弱阻尼的非局部高阶波方程的整体吸引子族

研究具变系数和弱阻尼的非局部高阶波方程的渐近行为,通过合理的先验估计及经典Galerkin方法证明了方程整体解的存在唯一性,再根据先验估计引理得到有界吸收集,进而得到该类方程的整体吸引子族.     

二阶锥权互补问题的非精确非内点连续化算法

基于二阶锥权互补函数,将二阶锥权互补问题转化为一个方程组,运用非精确非内点连续化算法求解该方程组.该算法能以任意点作为初始点,且每次迭代时至多求解一个方程组.为节省算法求解方程组时的计算时间和内存,将非精确牛顿法引入到算法中.在适当假设下,证明了该算法是全局与局部二阶收敛的.最后数值实验表明了算法的良好性能.     

变点统计分析简介(Ⅳ)局部比较法

一、方法的思想 在变点附近的“局部”中,某种量有了显著变化,它可以通过适当的估计去显示出来.在非变点附近的局部中,量保持稳定.这个差别就提供了发现变点的一个一般性方法:考察某种有针对性的统计量在各个“局部”内的变化,取其最显著之处作为变点位置的估计.当然,即使某个点非变点,但随机误差可能偶然以一种方式出现,使人误以为该处有显著变化,相反的情况也存在.这就需要通过检验来判定,那种程度的变化可视为显著的或随机性的,这涉及复杂的分布问题. 这个方法可用于种种模型,但在本文中,我们将只介绍其在一个简单模型──均值变点模型下…     

集值优化Benson真有效元的二阶刻画

引进了一种新的二阶组合切锥, 利用它引进了一种新的二阶组合切导数, 称为二阶组合径向切导数, 并讨论了它的性质及它与二阶组合切导数的关系, 借助二阶径向组合切导数, 分别建立了集值优化取得Benson真有效元的最优性充分和必要条件.     

累积Logistic回归模型结构变点的序贯检验

分类时间序列在生物医学、社会学和遗传学等领域有着广泛的应用,累积Logistic回归模型是分类时间序列建模的一类重要模型.本文基于偏似然得分过程(Partial likelihood score process)提出一种变点序贯检验方法,监测累积Logistic回归模型的结构是否发生变化.原假设下推导检验统计量的极限分...     

非参数模型均值函数结构变点的Bootstrap检测

本文检测非参数回归模型均值函数结构变点,针对均值函数跃度的长期均值为零时,基于残量的CUSUM统计量对均值函数结构变点检验无效的问题,本文提出了一种基于均值函数的核估计的检验统计量,得到统计量在原假设和备择假设下的极限分布,并构造Bootstrap方法对非参数回归模型均值函数结构变点进行检验,证明了检验和估计的一致性;模拟结果表明本文方法明显优于已有方法。     

非光滑半无限多目标规划弱非控解的充分性

本文利用锥次微分的概念，在一点处定义了η－（Ａ，Ｎ）凸函数、η－（Ａ，Ｎ）伪凸函数和η－（Ａ，Ｎ）严格伪凸函数，在相当弱的假设下，在η－（Ａ，Ｎ）意义下，给出了非光滑η－（Ａ，Ｎ）凸半无限多目标规划弱非控解的一些充分条件。     

Second-order optimality conditions for nondominated solutions of multiobjective programming with C 1,1 data

We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class C ^1,1. Second-order optimality conditions for local Pareto solutions are derived as a special case.     

Coderivative necessary optimality conditions for sharp and robust efficiencies in vector optimization with variable ordering structure

In this paper, we define two new concepts of efficiency for vector optimization with variable ordering structure, namely the sharp and robust efficiencies, and we study their connections with classical concepts of efficiency in vector optimization. Then, we get necessary optimality conditions for them using Fréchet and Mordukhovich calculus coupled with the Gerstewitz’s (Tammer’s) scalarizing functional and openness results for set-valued maps.     

Characterization of properly optimal elements with variable ordering structures

In vector optimization with a variable ordering structure, the partial ordering defined by a convex cone is replaced by a whole family of convex cones, one associated with each element of the space. In recent publications, it was started to develop a comprehensive theory for these vector optimization problems. Thereby, also notions of proper efficiency were generalized to variable ordering structures. In this paper, we study the relation between several types of proper optimality. We give scalarization results based on new functionals defined by elements from the dual cones which allow complete characterizations also in the nonconvex case.     

Optimality conditions for vector optimization problems with variable ordering structures

Our main concern in this article are concepts of nondominatedness w.r.t. a variable ordering structure introduced by Yu [P.L. Yu, Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives, J. Optim. Theory Appl. 14 (1974), pp. 319–377]. Our studies are motivated by some recent applications e.g. in medical image registration. Restricting ourselves to the case when the values of a cone-valued map defining the ordering structure are Bishop–Phelps cones, we obtain for the first time scalarizing functionals for nondominated elements, Fermat rule, Lagrange multiplier rule and duality results for a single- or set-valued vector optimization problem with a variable ordering structure.     

Algorithms for ordering unorganized points along parametrized curves

Letn points be given on several arcs of curve. The equations of these curves are unknown. We give two algorithms, based on geometrical criteria, that allow to determine an order on these points: the order given by the curvilinear abscissa. The computational complexity of these algorithms is inO(n logn) and the space complexity inO(n).     

Classification of three-class association schemes using backtracking with dynamic variable ordering

We describe several techniques for the exhaustive computer generation of non-isomorphic association schemes with a given set of intersection numbers using a backtracking algorithm with forward checking and dynamic variable ordering. We have applied these techniques to the classification of certain open parameter sets for three-class association schemes listed by Van Dam in (Three-class association schemes, J. Algebraic Combin. 10 (1999) 69–107) for which we present several new results. Among these are some new (imprimitive) distance regular graphs of diameter 3.     

Necessary and sufficient conditions for local and global nondominated solutions in decision problems with multi-objectives

In this paper, the decision problem with multi-objectives is considered, and the nondominated solutions associated with a polyhedral domination cone are discussed. The necessary and sufficient conditions for the solutions are given in the decision space rather than the objective space. The similarity of the solution conditions obtained in this article to the Kuhn-Tucker condition of a convex programming problem is examined. As an application of the solution condition, an algorithm to locate the set of all nondominated solutions is shown for the linear multi-objective decision problem.The author would like to thank the reviewer for his helpful comments.     

Convergence for vector optimization problems with variable ordering structure

In this paper, we first discuss the Painlevé–Kuratowski set convergence of (weak) minimal point set for a convex set, when the set and the ordering cone are both perturbed. Next, we consider a convex vector optimization problem, and take into account perturbations with respect to the feasible set, the objective function and the ordering cone. For this problem, by assuming that the data of the approximate problems converge to the data of the original problem in the sense of Painlevé–Kuratowski convergence and continuous convergence, we establish the Painlevé–Kuratowski set convergence of (weak) minimal point and (weak) efficient point sets of the approximate problems to the corresponding ones of original problem. We also compare our main theorems with existing results related to the same topic.     

Fixed points of discontinuous multivalued increasing operators in Banach spaces with applications

By using relatively weakly compactness conditions, we obtain existence theorems of fixed points for discontinuous multivalued increasing operators in Banach spaces. As an application, we utilize the results obtained in Section 2 to lead to the existence principles for integral inclusions of Hammerstein type multivalued maps.     

FIXED POINTS FOR WEAKLY INWARD MAPPINGS IN BANACH SPACES (Ⅱ)

S. Hu and Y. Sun[1] defined the fixed point index for weakly inward mappings, investigated its properties and studied fixed points for such mappings. In this paper, following S. Hu and Y. Sun, we further investigate boundary conditions, under which the fixed point index for i(A,Ω, p) is equal to nonzero, where i(A,Ω, p) is the completely continuous and weakly inward mapping. Correspondingly, we can obtain many new fixed point the-orems of the completely continuous and weakly inward mapping, which generalize...