LMI优化问题的择一性定理与对偶

考虑目标函数是线性函数约束条件为线性矩阵不等式的LMI优化问题,讨论了LMI优化问题中的四个择一性定理.每种类型的择一性定理包含两个线性不等式和(或)等式系统,一个原始系统和一个对偶系统.弱择一性定理说明两系统中至多只有其一有解;基于凸集分离理论得到的强择一性定理说明两系统有且仅有其一有解.并在此基础上推导了LMI优化...     

欧氏空间R3中的几个Bonnesen型不等式

本文研究欧氏空间R3中关于一个凸体的Bonnesen型不等式.利用包含测度的方法,获得了几个Bonnesen型不等式.     

Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints

In this paper, we propose an easily implementable algorithm in Hilbert spaces for solving some classical monotone variational inequality problem over the set of solutions of mixed variational inequalities. The proposed method combines two strategies: projected subgradient techniques and viscosity-type approximations. The involved stepsizes are controlled and a strong convergence theorem is established under very classical assumptions. Our algorithm can be applied for instance to some mathematical programs with complementarity constraints.     

Lyapunov-type inequality for a class of even-order differential equations

In this paper, we generalize the well-known Lyapunov-type inequality for second-order linear differential equations to a class of even-order linear differential equations, the results of this paper are new and generalize some known inequalities in the literatures.     

Exponential stability results for uncertain neutral systems with interval time-varying delays and Markovian jumping parameters

This paper deals with the global exponential stability analysis of neutral systems with Markovian jumping parameters and interval time-varying delays. The time-varying delay is assumed to belong to an interval, which means that the lower and upper bounds of interval time-varying delays are available. A new global exponential stability condition is derived in terms of linear matrix inequality (LMI) by constructing new Lyapunov-Krasovskii functionals via generalized eigenvalue problems (GEVPs). The stability criteria are formulated in the form of LMIs, which can be easily checked in practice by Matlab LMI control toolbox. Two numerical examples are given to demonstrate the effectiveness and less conservativeness of the proposed methods.     

Interpolation inequality of logarithmic type in abstract Besov spaces and an application to semilinear evolution equations

An abstract version of Besov spaces is introduced by using the resolvent of nonnegative operators. Interpolation inequalities with respect to abstract Besov spaces and generalized Lorentz spaces are obtained. These inequalities provide a generalization of Sobolev inequalities of logarithmic type. Uniqueness problems to abstract semilinear evolution equations are also discussed (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Facets for the cut cone I

We study facets of the cut coneC _n , i.e., the cone of dimension 1/2n(n – 1) generated by the cuts of the complete graph onn vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a lifting procedure for constructing facets ofC _n+1 from given facets of the lower dimensional coneC _n . After reviewing hypermetric valid inequalities, we describe the new class of cycle inequalities and prove the facet property for several subclasses. The new class of parachute facets is developed and other known facets and valid inequalities are presented.     

Weighted Estimations from a Conjugate Operator

In this Letter we develop a general procedure leading from a Mourre-type estimation for a given self-adjoint operator H to a Hardy-type weighted inequality. We use this method in order to prove exponential decay for eigenvectors of a large class of perturbations of operators of convolution with bounded analytic functions.     

H-空间中新的非紧极大极小定理、截口定理及非空交定理

本文在无线性结构Ｈ－空间的框架之下给出一个新的ｖｏｎ Ｎｅｕｍａｎｎ型非紧极大极小定理，并且作为其应用而得到一个新的Ｋｙ Ｆａｎ型截口定理和一个新的非空交定理．结果即使在欧几里得空间中也是全新的     

Motzkin decomposition of closed convex sets

Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. This paper provides five characterizations of the larger class of closed convex sets in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed in the paper. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed.