Vector complementarity problems with a variable ordering relation

In this paper, we investigate vector complementarity problems with a variable ordering relation. We establish existence results of a solution of a vector complementarity problem under an inclusive type condition. We obtain equivalence results among a vector complementarity problem, a vector variational inequality problem and other related problems.     

向量变分和向量拟变分不等式解的存在性定理及应用

本文利用纯量化方法及ＫＫＭ技巧,研究向量变分和向量拟变分不等式解的存在性问题,作为应用本文还研究了向量互补问题及最优化问题解的存在性及其等价性刻划。本文结果改进和推广了已有的结果。     

集值映象的向量变分不等式和相补问题

研究了一类集值映象的广义向量变分不等式和相补问题 ,证明了解的一些存在性定理 .推广和改进了文 [1 ,4 6 ]的相关研究成果 .     

Vector variational-like inequalities and non-smooth vector optimization problems

In this paper, we establish relationships between vector variational-like inequality problems and non-smooth vector optimization problems under non-smooth invexity. We identify the vector critical points, the weakly efficient points and the solutions of the non-smooth weak vector variational-like inequality problems, under non-smooth pseudo-invexity assumptions. These conditions are more general than those existing in the literature.     

On Vector Implicit Variational Inequalities and Complementarity Problems

In this paper, two vector implicit variational inequalities and three vector implicit complementarity problems are introduced with a more general order in ordered Banach spaces and the equivalence between them is studied under certain assumptions. Furthermore, some existence theorems of the vector implicit variational inequalities are proved. We answered the open question proposed by Rapcsák [Nonconvex Optim., Appl., Vol. 38, Kluwer Acad. Publ., Dordrecht, 2000, pp. 371–380]. This work was supported by the National Natural Science Foundation of China and the Scientific Research Foundation for the Returned Overseas Chinese, Scholars, State Education Ministry.     

伪单调型向量F-互补问题可行集的最小元问题

本文引入了几类向量F-互补问题并给出了向量F-互补问题与广义向量变分不等式之间的关系.通过定义向量F-互补问题的可行集,研究了伪单调型向量F-互补问题的可行集的最小问题,推广了已有的一些结果.     

Generalized asymptotic functions in nonconvex multiobjective optimization problems

In this paper, we use generalized asymptotic functions and second-order asymptotic cones to develop a general existence result for the nonemptiness of the proper efficient solution set and a sufficient condition for the domination property in nonconvex multiobjective optimization problems. A new necessary condition for a point to be efficient or weakly efficient solution is given without any convexity assumption. We also provide a finer outer estimate for the asymptotic cone of the weakly efficient solution set in the quasiconvex case. Finally, we apply our results to the linear fractional multiobjective optimization problem.     

Vector complementarity and minimal element problems

In this paper, vector complementarity problems are introduced as weak versions of vector variational inequalities in ordered Banach spaces. New dual cones are introduced and proved to be closed. In the sense of efficient point, we prove that the minimal element problem is solvable if a vector variational inequality is solvable; we also prove that any solution of a strong vector variational inequality or positive vector complementarity problem is a solution of the minimal element problem.This work was done while the author was with the Chongqing Institute of Architecture and Engineering, Chongqing, P. R. China.     

Vector optimization problems with quasiconvex constraints

Let X be a real linear space, a convex set, Y and Z topological real linear spaces. The constrained optimization problem min _C f(x), is considered, where f : X ₀→ Y and g : X ₀→ Z are given (nonsmooth) functions, and and are closed convex cones. The weakly efficient solutions (w-minimizers) of this problem are investigated. When g obeys quasiconvex properties, first-order necessary and first-order sufficient optimality conditions in terms of Dini directional derivatives are obtained. In the special case of problems with pseudoconvex data it is shown that these conditions characterize the global w-minimizers and generalize known results from convex vector programming. The obtained results are applied to the special case of problems with finite dimensional image spaces and ordering cones the positive orthants, in particular to scalar problems with quasiconvex constraints. It is shown, that the quasiconvexity of the constraints allows to formulate the optimality conditions using the more simple single valued Dini derivatives instead of the set valued ones.      

On nonconvex optimization problems with separated nonconvex variables

A mathematical programming problem is said to have separated nonconvex variables when the variables can be divided into two groups: x=(x ₁,...,x _n ) and y=( y ₁,...,y _n ), such that the objective function and any constraint function is a sum of a convex function of (x, y) jointly and a nonconvex function of x alone. A method is proposed for solving a class of such problems which includes Lipschitz optimization, reverse convex programming problems and also more general nonconvex optimization problems.     

DC approach to weakly convex optimization and nonconvex quadratic optimization problems

Motivated by weakly convex optimization and quadratic optimization problems, we first show that there is no duality gap between a difference of convex (DC) program over DC constraints and its associated dual problem. We then provide certificates of global optimality for a class of nonconvex optimization problems. As an application, we derive characterizations of robust solutions for uncertain general nonconvex quadratic optimization problems over nonconvex quadratic constraints.     

The system of generalized vector equilibrium problems with applications

In this paper, we introduce the system of generalized vector equilibrium problems which includes as special cases the system of generalized implicit vector variational inequality problems, the system of generalized vector variational and variational-like inequality problems and the system of vector equilibrium problems. By using a maximal element theorem, we establish existence results for a solution of these systems. As an application, we derive existence results for a solution of a more general Nash equilibrium problem for vector-valued functions.     

Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems

Whether or not the general asymmetric variational inequality problem can be formulated as a differentiable optimization problem has been an open question. This paper gives an affirmative answer to this question. We provide a new optimization problem formulation of the variational inequality problem, and show that its objective function is continuously differentiable whenever the mapping involved in the latter problem is continuously differentiable. We also show that under appropriate assumptions on the latter mapping, any stationary point of the optimization problem is a global optimal solution, and hence solves the variational inequality problem. We discuss descent methods for solving the equivalent optimization problem and comment on systems of nonlinear equations and nonlinear complementarity problems.     

On nonconvex optimization with integral constraints

We consider the problem of minimizing f(y)dm with y dm=c,c fixed. The functionf is assumed to be continuous, but need not be convex. For this problem, we give necessary and sufficient conditions for the existence of solutions. We also give conditions under which uniqueness in a certain sense holds, and we show a relation which holds between the minimizers of two different problems and the corresponding values of the constraintsc.This research was supported by FINEP-Brazil, Grant Nos. 62.24-0416-00 and 4.2.82.0719-00.     

Simultaneous Vector Variational Inequalities and Vector Implicit Complementarity Problem

The concepts of monotone pair of mappings and vector implicit complementarity problem (VICP) in ordered Banach spaces are introduced. Existence theorems for simultaneous vector variational inequalities (VVI) and VICP are proved.     

集值映射的对称向量拟均衡问题

研究向量集值映射的拟均衡问题的有效解,利用数值化方法与不动点定理,得到解的存在性定理.作为应用,得到广义向量鞍点,向量变分不等式与向量互补问题的存在性定理.     

Vector Variational Inequality and Vector Pseudolinear Optimization

The study of a vector variational inequality has been advanced because it has many applications in vector optimization problems and vector equilibrium flows. In this paper, we discuss relations between a solution of a vector variational inequality and a Pareto solution or a properly efficient solution of a vector optimization problem. We show that a vector variational inequality is a necessary and sufficient optimality condition for an efficient solution of the vector pseudolinear optimization problem.     

Pointwise Well-Posedness of Perturbed Vector Optimization Problems in a Vector-Valued Variational Principle

In this note, we point out and correct some errors in Ref. 1. Another type of pointwise well-posedness and strong pointwise well-posedness of vector optimization problems is introduced. Sufficient conditions to guarantee this type of well-posedness are provided for perturbed vector optimization problems in connection with the vector-valued Ekeland variational principle.     

On perturbations of certain nonconvex optimization problems

Using the concept of -conjugate functions, a wide class of nonconvex optimization problems can be investigated. By generalized Lagrangians, the problems indicated and a generalized notion of stability can be treated. It is possible to give duality theorems for these problems such that the approach given by Rockafellar (1967) for convex problems can be extended to the nonconvex case.