弱向量变分不等式的解集及其连通性

建立Hausdorff拓扑向量空间的非空凸子集到其值域为连续线性映射空间L(X, Y) 内的C -单调映射的弱向量变分不等式和它的纯量型变分不等式问题解的存在性, 讨论该弱向量变分不等式与之相联系的纯量型变分不等式解集的关系, 利用映射的C -弱次连续和C -单调性及其集值映射的不动点定理,通过纯量型变分不等式解集所诱导的集值映射所具有的特性给出弱向量变分不等式解集的连通性.     

非强制混合向量变分不等式解的存在性研究

本文利用例外簇方法研究非强制混合向量变分不等式的弱有效解的存在性:首先证明若混合向量变分不等式问题不存在例外簇,则混合向量变分不等式问题的弱有效解集为非空集合:利用向量值映射的渐近映射给出自反Banach空间中非强制混合向量变分不等式的弱有效解集不存在例外簇的充分条件,从而得到混合向量变分不等式问题的弱有效解的存在性结果;我们研究了当算子为余正仿射算子时,给出混合仿射向量变分不等式不存在例外簇的充分条件,得到混合仿射向量变分不等式弱有效解的存在性,给出了混合仿射向量变分不等式的弱有效解集为非空紧致集的充分条件.将Iusem等人(2019)在有限维空间中标量混合变分不等式解的存在性结果推广到自反Banach空间中混合向量变分不等式.     

集值变分不等式问题的例外簇

本文首先在Banach空间中证明了零调集值映射的一个Leray-Schauder型不动点定理,然后在Hilbert空间中定义了零调集值映射的变分不等式的例外簇,利用本文给出的不动点定理给出了无界集上的变分不等式问题存在解的一个充分条件．此条件弱于许多已知的关于变分不等式问题的解的存在性条件,并由此得到Hilbert空间中几个变分不等式约解的存在性定理．     

一类积集上的广义向量变分不等式

研究一类积集上具某种权向量的广义向量变分不等式组及其广义向量变分不等式的有关问题,刻画它们之间解的相互关系.在映射的次连续性和关于某向量广义单调性的条件下,利用集值映射的不动点定理,对所讨论的几种类型的广义向量变分不等式给出解的存在性.     

混合向量变分不等式标量化及间隙函数误差界

利用Konnov对变分不等式问题的标量化方法,对一般的强变分不等式（SVI）和弱变分不等式（WVI）进行了进一步的推广.主要介绍了基于集值映射的强广义混合向量变分不等式（SGMVVI）和弱广义混合向量变分不等式（WGMVVI）,考虑了与它们相关的间隙函数,在合适的条件下讨论了强广义混合集值变分不等式（SGMVI）的间隙函数和SGMVVI的间隙函数之间的关系,以及WGMVVI和SGMVI的间隙函数之间的关系,最后讨论了它们的间隙函数的全局误差界.     

向量变分不等式的严格可行性问题

本篇文章首先定义了向量变分不等式的严格可行点概念,其次在假设了映射是强(D)-伪单调的情况下,证明了向量变分不等式解集非空有界与其严格可行点存在的等价性问题,推广了在数量变分不等式上得到的相应结果．     

一般多值向量变分不等式问题

本文引入一般多值向量变分不等式问题（GMVVI）,这推广和统一了现有的向量变分不等式,文内还引入了弱C－伪单调映射和半连续映的概念,在弱C－伪单调性和半连续性的假设下,给出了（GMVVI）的广义线性化引理和解的存在定理,本文的结果即使对一般向量变分不等式问题和广义向量变分不等式问题也是全新的。     

一种新的求解拟单调变分不等式的压缩投影算法

2020年Liu和Yang提出了求解Hilbert空间中拟单调且Lipschitz连续的变分不等式问题的投影算法,简称LYA。本文在欧氏空间中提出了一种新的求解拟单调变分不等式的压缩投影算法,简称NPCA。新算法削弱了LYA中映射的Lipschitz连续性。在映射连续、拟单调且对偶变分不等式解集非空的条件下得到了NPCA所生成点列的聚点是解的结论。当变分不等式的解集还满足一定条件时,得到了NPCA的全局收敛性。数值实验结果表明NPCA所需的迭代步数少于LYA的迭代步数,NPCA在高维拟单调例子中所需的计算机耗时也更少。     

一种新修正的求解变分不等式的双次梯度外梯度算法

当可行集为一光滑凸函数的下水平集时, 本文提出一种修正的双次梯度外梯度算法(MTSEGA)用于求解Hilbert空间中单调且Lipschitz连续的变分不等式. MTSEGA在每步迭代过程中仅需计算向半空间的两次投影及一次映射的值. 在与已知算法相同的假设条件下, 证明了新算法产生的序列能弱收敛到相关问题的一个解.     

伪线性映射及其变分不等式解的特征

研究拓扑向量空间到其共轭空间的伪线性映射和其变分不等式问题,给出伪线性映射的几个等价形式,并对伪线性映射的变分不等式解集的特征进行了刻画.     

求解非单调变分不等式的一种二次投影算法北大核心CSCD

投影算法是求解变分不等式问题的主要方法之一.目前,有关投影算法的研究通常需要假设映射是单调且Lipschitz连续的,然而在实际问题中,往往不满足这些假设条件.该文利用线搜索方法,提出了一种新的求解非单调变分不等式问题的二次投影算法.在一致连续假设下,证明了算法产生的迭代序列强收敛到变分不等式问题的解.数值实验结果表明了该文所提算法的有效性和优越性.     

Stability and Sensitivity Analysis of Solutions to Weak Vector Variational Inequalities

The paper mainly concerns the study of a parametric weak vector variational inequality. Robinson’s metric regularity and Lipschitzian stability of the solution mapping for the parametric weak vector variational inequality are firstly established. Then sensitivity analysis of the solution mapping for the parametric weak vector variational inequality is discussed. As applications, Lipschitzian continuity and differentiability of the solution mapping are also investigated for a parametric variational inequality.     

Connectedness of Cone-Efficient Solution Set for Cone-Quasiconvex Multiobjective Programming in Locally Convex Spaces

This paper deals with the connectedness of the cone-efficient solution set for vector optimization inlocally convex Hausdorff topological vector spaces.The connectedness of the cone-efficient solution set is provedfor multiobjective programming defined by a continuous cone-quasiconvex mapping on a compact convex set ofalternatives.The generalized saddle theorem plays a key role in the proof.     

Hybrid Approximate Proximal Method with Auxiliary Variational Inequality for Vector Optimization

This paper studies a general vector optimization problem of finding weakly efficient points for mappings from Hilbert spaces to arbitrary Banach spaces, where the latter are partially ordered by some closed, convex, and pointed cones with nonempty interiors. To find solutions of this vector optimization problem, we introduce an auxiliary variational inequality problem for a monotone and Lipschitz continuous mapping. The approximate proximal method in vector optimization is extended to develop a hybrid approximate proximal method for the general vector optimization problem under consideration by combining an extragradient method to find a solution of the variational inequality problem and an approximate proximal point method for finding a root of a maximal monotone operator. In this hybrid approximate proximal method, the subproblems consist of finding approximate solutions to the variational inequality problem for monotone and Lipschitz continuous mapping, and then finding weakly efficient points for a suitable regularization of the original mapping. We present both absolute and relative versions of our hybrid algorithm in which the subproblems are solved only approximately. The weak convergence of the generated sequence to a weak efficient point is established under quite mild assumptions. In addition, we develop some extensions of our hybrid algorithms for vector optimization by using Bregman-type functions.     

拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性(英文)

本文研究局部凸的拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题.证明了定义在紧凸集上目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的.在证明中,广义鞍点定理起着关键的作用.     

Differential Vector Variational Inequalities in Finite-Dimensional Spaces

In this paper, a differential vector variational inequality is introduced and studied in finite-dimensional Euclidean spaces. The existence of a Carathéodory weak solution for the differential vector variational inequality is presented under some suitable conditions. Furthermore, the upper semicontinuity and the lower semicontinuity of the solution sets for the differential variational inequality are established when both the mapping and the constraint set are perturbed by two different parameters.     

Gap functions for constrained vector variational inequalities with applications

In this paper, the image space analysis is applied to investigate scalar-valued gap functions and their applications for a (parametric)-constrained vector variational inequality. Firstly, using a non-linear regular weak separation function in image space, a gap function of a constrained vector variational inequality is obtained without any assumptions. Then, as an application of the gap function, two error bounds for the constrained vector variational inequality are derived by means of the gap function under some mild assumptions. Further, a parametric gap function of a parametric constrained vector variational inequality is presented. As an application of the parametric gap function, a sufficient condition for the continuity of the solution map of the parametric constrained vector variational inequality is established within the continuity and strict convexity of the parametric gap function. These assumptions do not include any information on the solution set of the parametric constrained vector variational inequality.     

Existence of Solutions to Generalized Vector Quasi-variational-like Inequalities with Set-valued Mappings

In this paper, we introduce and study a class of generalized vector quasivariational-like inequality problems, which includes generalized nonlinear vector variational inequality problems, generalized vector variational inequality problems and generalized vector variational-like inequality problems as special cases. We use the maximal element theorem with an escaping sequence to prove the existence results of a solution for generalized vector quasi-variational-like inequalities without any monotonicity conditions in the setting of locally convex topological vector space.