Isometries for Ky Fan norms between matrix spaces

We characterize linear maps between different rectangular matrix spaces preserving Ky Fan norms.

     

On Representations Associated with Completely n-Positive Linear Maps on Pro-C^＊-Algebras

It is shown that an n × n matrix of continuous linear maps from a pro-C^＊-algebra A to L（H）, which verifies the condition of complete positivity, is of the form [V^＊TijФ（·）V]^n i,where Ф is a representation of A on a Hilbert space K, V is a bounded linear operator from H to K, and j=1,[Tij]^n i,j=1 is a positive element in the C^＊-algebra of all n×n matrices over the commutant of Ф（A） in L（K）. This generalizes a result of C. Y.Suen in Proc. Amer. Math. Soc., 112（3）, 1991, 709-712. Also, a covariant version of this construction is given.     

A continuity theorem for Stinespring's dilation

We show a continuity theorem for Stinespring's dilation: two completely positive maps between arbitrary C^∗-algebras are close in cb-norm if and only if we can find corresponding dilations that are close in operator norm. The proof establishes the equivalence of the cb-norm distance and the Bures distance for completely positive maps. We briefly discuss applications to quantum information theory.     

Common fixed point results for noncommuting mappings without continuity in cone metric spaces

The existence of coincidence points and common fixed points for mappings satisfying certain contractive conditions, without appealing to continuity, in a cone metric space is established. These results generalize several well-known comparable results in the literature.     

Uniform LP duality for semidefinite and semi-infinite programming

Recently, a semidefinite and semi-infinite linear programming problem (SDSIP), its dual (DSDSIP), and uniform LP duality between (SDSIP) and (DSDSIP) were proposed and studied by Li et al. (Optimization 52:507–528, 2003). In this paper, we show that (SDSIP) is an ordinary linear semi-infinite program and, therefore, all the existing results regarding duality and uniform LP duality for linear semi-infinite programs can be applied to (SDSIP). By this approach, the main results of Li et al. (Optimization 52:507–528, 2003) can be obtained easily.     

Optimality for (<Emphasis Type="Italic">h,φ</Emphasis>)-multiobjective programming involving generalized type-I functions

Based upon Ben-Tal’s generalized algebraic operations, new classes of functions, namely (h,φ)-type-I, quasi (h,φ)-type-I, and pseudo (h,φ)-type-I, are defined for a multi-objective programming problem. Sufficient optimality conditions are obtained for a feasible solution to be a Pareto efficient solution for this problem. Some duality results are established by utilizing the above defined classes of functions, considering the concept of a Pareto efficient solution. This research is supported by National Science Foundation of China under Grant No. 69972036.     

Critical duality

We look for a general framework in which the Ekeland duality can be formulated. We propose a scheme in which the parameter sets are provided with a coupling function which induces a conjugacy. The decision spaces are not supposed to have any special structure. We examine several examples. In particular, we consider some special classes of generalized convex functions.     

Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach

We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value functions in both stages. We give two algorithms for finding the value functions. To solve the reformulation after obtaining the value functions, we develop a global branch-and-bound approach and a level-set approach to find an optimal tender. We show that our method can solve randomly generated instances whose extensive forms are several orders of magnitude larger than the extensive forms of those instances found in the literature. This work is supported by National Science Foundation grants DMI-0217190 and DMI-0355433.     

基于稀疏活动轮廓模型的感兴趣目标检测定位算法

传统的基于形状信息目标定位的算法,对目标观测角度发生形变情况下的定位存在不少困难,针对该问题,提出了一种基于稀疏活动轮廓模型的感兴趣目标(OOI)检测算法.首先通过共同勾画算法学习到感兴趣目标的稀疏活动轮廓模型,它能够清晰地定义感兴趣目标模式;同时构成该模型的Gabor轮廓基元可以通过扰动进行局部的调整以适配图像,在一...