集合函数多目标规划的拉格朗日型对偶定理

本文在［１］的基础上．给出了集合函数多目标规划的拉格朗日型弱对偶定理，严格对偶定理和逆对偶定理．     

Banach空间中对偶规划的存在性定理

本文利用无穷下降方向，在Ｂａｎａｃｈ空间中建立了若干非凸对偶规划的存在性定理。作为特例，给出了半无限对偶规划和有限对偶规划的存在性定理。     

非光滑伪线性多目标规划对偶

本文利用Ｄｉｎｉ右上、右下导数给出了非光滑伪线性多目标规划的对偶理论，建立了Ｍｏｎｄ－Ｗｅｉｒ型对仍与Ｗｏｌｆ型对偶；并证明了原问题与对偶问题之间的对偶定理．     

广义次似凸集值优化的对偶定理

我们讨论了广义次似凸集值优化的对偶定理.首先,我们给出了广义次似凸集值优化的对偶问题.其次,我们给出了广义次似凸集值优化的对偶定理.最后,我们考虑了广义次似凸集值优化问题的标量化对偶,并给出了一系列对偶定理.     

实值随机变量的随机序与对偶随机序

本文讨论随机变量的高阶序问题，1简要地叙述了随机变量排序的经济学含义，主要是期望效用理论与其对偶理论，2讨论了实值随机变量基于分布函数的高阶序问题，给出了其基于期望效用理论的刻画。3讨论的是实值随机变量的基于对偶理论（对偶矩)的高阶序问题，并给出了其基于随机变量的Yarri等价性度量的刻画。     

常循环码的s-Hermitian自对偶码

主要研究了常循环码的自对偶码.给出了s-Hermitian自对偶码的定义,并进一步给出了s-Hermitian自对偶常循环码的的充要条件.     

常循环码的自对偶码

主要研究了常循环码的欧氏自对偶码以及Hermitian自对偶码.通过运用离散的傅里叶变换,给出了欧氏自对偶常循环码的存在条件.进一步对常循环码的Hermitian自对偶码进行研究,给出了Hermitian自对偶常循环码存在的充分必要条件.     

长方对偶矩阵的加权对偶群逆的存在性与表示

本文研究了长方对偶矩阵的加权对偶群逆的存在性与表示问题.利用矩阵的秩和分块表示等给出了长方对偶矩阵的加权对偶群逆存在的若干充分必要条件,并在加权对偶群逆存在的情形下给出了其表达式,推广了对偶群逆的相关结论.通过数值例子说明了加权对偶群逆存在时的计算方法.     

关于半无限规划的对偶间隙

该文对半无限凸规划（Ｐ）提出了一个对偶问题（Ｄ１），证明了（Ｄ１）与（Ｐ）无对偶间隙当且仅当Ｌａｇｒａｎｇｅ对偶问题（Ｄ）与（Ｐ）之间无对偶间隙，作者还利用方向导数给出一个新的刻划鞍点准则的方法。     

用次微分表达的对偶问题

本利用次微分建立了多目标规划的一个新的对偶问题，并给出其弱、强和逆对偶性，得到了一个新的次梯度的定义，并用其建立了一个新的对偶问题。     

Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior

The existence of saddle point of the Lagrange function for a convex programming problem in Banach spaces ordered by a cone with empty interior is established under a strong simultaneity condition. As a consequence, the Kuhn–Tucker conditions are derived. It is shown that the Slater and the strong simultaneity condition are equivalent if the cone determining the partial order has an interior.     

Farkas' Lemma, other theorems of the alternative, and linear programming in infinite-dimensional spaces: a purely linear-algebraic approach

We briefly consider several formulations of Farkas' Lemma first. Then we assume the setting of two vector spaces, one of them being linearly ordered, over a linearly ordered field till the end of this article. In this setting, we state a generalized version of Farkas' Lemma and prove it in a purely linear-algebraic way. Afterwards, we present Theorems of Motzkin, Tucker, Carver, Dax, and some other theorems of the alternative that characterize consistency of a finite system of linear inequalities. We also mention the Key Theorem, which is a related result. Finally, we use Farkas' Lemma to prove the Duality Theorem for linear programming (with a finite number of linear constraints). The Duality Theorem that is proved here covers, among others, linear programming in a real vector space of finite or infinite dimension and lexicographic linear programming.     

A condition for the nonsymmetric saddle point matrix being diagonalizable and having real and positive eigenvalues

This paper discusses the spectral properties of the nonsymmetric saddle point matrices of the form with A symmetric positive definite, B full rank, and C symmetric positive semidefinite. A new sufficient condition is obtained so that is diagonalizable with all its eigenvalues real and positive. This condition is weaker than that stated in the recent paper [J. Liesen, A note on the eigenvalues of saddle point matrices, Technical Report 10-2006, Institute of Mathematics, TU Berlin, 2006].     

Properties of saddle points for generalized augmented Lagrangian

For inequality constrained optimization problem, we show the existence of local saddle point of generalized augmented Lagrangian under weak second-order sufficient conditions which are weaker than the second-order sufficient conditions in the literature. We further discuss the existence of global saddle points without requiring the uniqueness of the global optimal solution. This work was supported by the National Natural Science Foundation of China grants 10571106, 10471159.     

ψ-序压缩算子的不动点定理

2005年,张宪在Banach空间中通过其中的锥所定义的半序引进了序压缩算子,证明了几个相应的定理．但是在一般的度量空间中,能否定义序压缩算子,能否得到类似的结论呢？本文在度量空间X中,通过X上的泛函ψ-所定义的半序,引进了ψ--序压缩算子,并且得到了相应的不动点定理．     

Linear programming over ordered bodies

The theory of linear programming over an arbitrary ordered body is considered. The Farkas and Duality Theorems are generalized. A method is given for solving the problems under consideration.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 3, pp. 308–312, March, 1990.     

Distributionally robust optimization with correlated data from vector autoregressive processes

We present a distributionally robust formulation of a stochastic optimization problem for non-i.i.d vector autoregressive data. We use the Wasserstein distance to define robustness in the space of distributions and we show, using duality theory, that the problem is equivalent to a finite convex–concave saddle point problem. The performance of the method is demonstrated on both synthetic and real data.     

DEMICONTINUITY,GENERALIZED CONVEXITY AND LOOSE SADDLE POINTS OF SET-VALUED MAPS

Abstract

The aim of this paper is to establish the existence of loose saddle points for a set-valued map which is defined in a topological vector space and possesses the demicontinuity and generalized convexity. Our results strengthen several previously obtained results on the existence of saddle and loose saddle points for single- or set-valued maps.     

Banach空间中α-序压缩映射的不动点定理

在Banach空间中引入了几种压缩映射,证明了一类非线性映射的不动点的存在性,并改进和推广了相应定理.     

A generalized section theorem and a minimax inequality for a vector-valued mapping 1

A generalized Fan's section theorem has proposed by replacing convexity assumptions with merely topological properties. A generalized reformulation of Browder's fixed point theorem has derived. The Minimax Inequalities for vector-valued mapping in an ordered Banach space have established without the convexity and with convexity, respectively.