A new class of alternative theorems for SOS-convex inequalities and robust optimization

In this paper, we present a new class of alternative theorems for SOS-convex inequality systems without any qualifications. This class of theorems provides an alternative equations in terms of sums of squares to the solvability of the given inequality system. A strong separation theorem for convex sets, described by convex polynomial inequalities, plays a key role in establishing the class of alternative theorems. Consequently, we show that the optimal values of various classes of robust convex optimization problems are equal to the optimal values of related semidefinite programming problems (SDPs) and so, the value of the robust problem can be found by solving a single SDP. The class of problems includes programs with SOS-convex polynomials under data uncertainty in the objective function such as uncertain quadratically constrained quadratic programs. The SOS-convexity is a computationally tractable relaxation of convexity for a real polynomial. We also provide an application of our theorem of the alternative to a multi-objective convex optimization under data uncertainty.     

A Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials

The minimax theorem for a convex-concave bifunction is a fundamental theorem in optimization and convex analysis, and has a lot of applications in economics. In the last two decades, a nonconvex extension of this minimax theorem has been well studied under various generalized convexity assumptions. In this note, by exploiting the hidden convexity (joint range convexity) of separable homogeneous polynomials, we establish a nonconvex minimax theorem involving separable homogeneous polynomials. Our result complements the existing study of nonconvex minimax theorem by obtaining easily verifiable conditions for the nonconvex minimax theorem to hold.     

A common fixed point theorem with applications to vector equilibrium problems

In this paper, using the Brouwer fixed point theorem, we establish a common fixed point theorem for a family of set-valued mappings. As applications of this result we obtain existence theorems for the solutions of two types of vector equilibrium problems, a Ky Fan-type minimax inequality and a generalization of a known result due to Iohvidov.     

Farkas-type Results for Max-functions and Applications

We present some Farkas-type results for inequality systems involving finitely many convex constraints as well as convex max-functions. Therefore we use the dual of a minmax optimization problem. The main theorem and its consequences allows us to establish, as particular instances, some set containment characterizations and to rediscover two famous theorems of the alternative.     

Generalized vector variational inequality and fuzzy extension

A generalized vector variational inequality (GVVI) is considered. We establish the existence theorem for (GVVI) under assumptions of C-pseudomonotonicity and V-hemicontinuity. From our existence theorem, we obtain the fuzzy extension of a result of Chen and Yang.     

On alternative theorems and necessary conditions for efficiency

In this article, we establish theorems of the alternative for a system described by inequalities, equalities and a set inclusion, which are generalizations of Tucker's classical theorem of the alternative, and develop Kuhn–Tucker necessary conditions for efficiency to mathematical programs in normed linear spaces involving inequality, equality and set constraints with positive Lagrange multipliers of all the components of objective functions.     

Generalization of an Existence Theorem for Variational Inequalities

By using the concept of exceptional family of elements, Zhao proposed a new existence theorem for variational inequalities over a general nonempty closed convex set (Ref. 1, Theorem 2.3), which is a generalization of the well-known Moré's existence theorem for nonlinear complementarity problems. The proof of Theorem 2.3 in Ref. 1 depends strongly on the condition 0∈K. Since this condition is rather strict for a general variational inequality, Zhao proposed an open question at the end of Ref. 1: Can the condition 0∈K in Theorem 2.3 be removed? In this paper, we answer this open question. Furthermore, we present the new notion of exceptional family of elements and establish a theorem of the alternative, by which we develop two new existence theorems for variational inequalities. Our results generalize the Zhao existence result.     

A Class of differential inverse variational inequalities in finite dimensional spaces

In this paper, we study a class of differential inverse variational inequality (for short, DIVI) in finite dimensional Euclidean spaces. Firstly, under some suitable assumptions, we obtain linear growth of the solution set for the inverse variational inequalities. Secondly, we prove existence theorems for weak solutions of the DIVI in the weak sense of Carath\"{e}odory by using measurable selection lemma. Thirdly, by employing the results from differential inclusions we establish a convergence result on Euler time dependent procedure for solving the DIVI. Finally, we give a numerical experiment to verify the validity of the algorithm.     

Exceptional family and solution existence of variational inequality problems with set-valued mappings

In this paper, we introduce a new exceptional family for a variational inequality with a set-valued mapping over a general unbounded closed convex set in a Hilbert space. By means of the exceptional family and topological degree theory of set-valued mappings, an alternative theorem and some solution existence theorems are obtained.     

抽象凸空间上的弱KKM映射, 相交定理和极大极小不等式

In this paper,we introduce the concept of weakly KKM map on an abstract convex space without any topology and linear structure,and obtain Fan＇s matching theorem and intersection theorem under very weak assumptions on abstract convex spaces.Finally,we give several minimax inequality theorems as applications.These results generalize and improve many known results in recent literature.     

Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems

In this paper we first establish a Lagrange multiplier condition characterizing a regularized Lagrangian duality for quadratic minimization problems with finitely many linear equality and quadratic inequality constraints, where the linear constraints are not relaxed in the regularized Lagrangian dual. In particular, in the case of a quadratic optimization problem with a single quadratic inequality constraint such as the linearly constrained trust-region problems, we show that the Slater constraint qualification (SCQ) is necessary and sufficient for the regularized Lagrangian duality in the sense that the regularized duality holds for each quadratic objective function over the constraints if and only if (SCQ) holds. A new theorem of the alternative for systems involving both equality constraints and two quadratic inequality constraints plays a key role. We also provide classes of quadratic programs, including a class of CDT-subproblems with linear equality constraints, where (SCQ) ensures regularized Lagrangian duality.     

Error bounds for analytic systems and their applications

Using a 1958 result of Lojasiewicz, we establish an error bound for analytic systems consisting of equalities and inequalities defined by real analytic functions. In particular, we show that over any bounded region, the distance from any vectorx in the region to the solution set of an analytic system is bounded by a residual function, raised to a certain power, evaluated atx. For quadratic systems satisfying certain nonnegativity assumptions, we show that this exponent is equal to 1/2. We apply the error bounds to the Karush—Kuhn—Tucker system of a variational inequality, the affine variational inequality, the linear and nonlinear complementarity problem, and the 0–1 integer feasibility problem, and obtain new error bound results for these problems. The latter results extend previous work for polynomial systems and explain why a certain square-root term is needed in an error bound for the (monotone) linear complementarity problem.The research of this author is based on work supported by the Natural Sciences and Engineering Research Council of Canada under grant OPG0090391.The research of this author is based on work supported by the National Science Foundation under grants DDM-9104078 and CCR-9213739 and by the Office of Naval Research under grant 4116687-01.     

Modified Tseng’s extragradient algorithms for variational inequality problems

In this work, our interest is in investigating the monotone variational inequality problems in the framework of real Hilbert spaces. For solving this problem, we introduce two modified Tseng’s extragradient methods using the inertial technique. The weak convergence theorems are established under the standard assumptions imposed on cost operators. Finally, numerical results are reported to illustrate the behavior of the new algorithms and also to compare with others.     

变分不等式问题的一个新的存在性定理

对于具有一般非空闭凸集约束的变分不等式问题 ,本文给出了一个新的例外族的定义 .通过倩同伦不变定理 ,我们证明了一个择一定理 ,这给出了所考虑问题解的一个充分性条件 .特别 ,我们建立了变分不等式问题的一个新的存在性定理 ,推广了Zhao的一个最近的存在性结果 ,进而也推广了著名Mor啨关于非线性互补问题的存在性定理 .     

MIXED VARIATIONAL INEQUALITIES DRIVEN BY FRACTIONAL EVOLUTIONARY EQUATIONS

The goal of the present paper is to investigate an abstract system, called fractional differential variational inequality, which consists of a mixed variational inequality combined with a fractional evolution equation in the framework of Banach spaces. Using discrete approximation approach, an existence theorem of solutions for the inequality is established under some suitable assumptions.     

A bivariate Markov inequality for Chebyshev polynomials of the second kind

This note presents a Markov-type inequality for polynomials in two variables where the Chebyshev polynomials of the second kind in either one of the variables are extremal. We assume a bound on a polynomial at the set of even or odd Chebyshev nodes with the boundary nodes omitted and obtain bounds on its even or odd order directional derivatives in a critical direction. Previously, the author has given a corresponding inequality for Chebyshev polynomials of the first kind and has obtained the extension of V.A. Markov’s theorem to real normed linear spaces as an easy corollary.To prove our inequality we construct Lagrange polynomials for the new class of nodes we consider and give a corresponding Christoffel–Darboux formula. It is enough to determine the sign of the directional derivatives of the Lagrange polynomials.     

Generalized Motzkin Theorems of the Alternative and Vector Optimization Problems

In this paper, we introduce a definition of generalized convexlike functions (preconvexlike functions). Then, under the weakened convexity, we study vector optimization problems in Hausdorff topological linear spaces. We establish some generalized Motzkin theorems of the alternative. By use of these theorems of the alternative, we obtain some Lagrangian multiplier theorems. A saddle-point theorem and a scalarization theorem are also derived.Communicated by F. GiannessiThe author thank Ginndomenico Mastrocni for helpful and useful comments.     

Extreme properties of quermassintegrals of convex bodies

In this paper, we establish two theorems for the quermassintegrals of convex bodies, which are the generalizations of the well-known Aleksandrov’ s projection theorem and Loomis-Whitney’ s inequality, respectively. Applying these two theorems, we obtain a number of inequalities for the volumes of projections of convex bodies. Besides, we introduce the concept of the perturbation element of a convex body, and prove an extreme property of it.     

Existence of Solutions to a Generalized System

In this paper, we consider a generalized system in real Banach spaces. Using Brouwer’s fixed-point theorem, we establish some existence theorems for generalized system without monotonicity. Further, we extend the concept of C-strong pseudomonotonicity for a bifunction and extend Minty’s lemma for a generalized system. Furthermore, using the Minty lemma and KKM-Fan lemma, we establish an existence theorem for a generalized system with monotonicity in real reflexive Banach spaces.     

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

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