一类广义隐互补问题的投影组合算法

隐互补问题在自然科学中的诸多领域有着广泛的应用.研究了一类广义隐互补问题.利用外梯度法的两种改进算法构造了新的投影迭代算法,并将其应用到这类广义隐互补问题中,研究了在伪单调的条件下算法的收敛性,并讨论了新算法的参数和校正步长的选择方法.     

线性互补约束规划问题的一种Filter算法

本文研究了求解线性互补约束规划问题的算法问题.首先基于广义互补函数和摄动技术将问题转化为带参数的非线性优化问题,利用SlQP-Filter算法方法,求解线性互补约束规划问题的一种Filter算法.在适当条件下,证明了该算法的全局收敛性.     

一类广义多项式互补问题的光滑化共轭梯度法

本文研究了一类广义多项式互补问题,在一定条件下,证明了其有唯一解.通过极大极小转化技术,将此类广义多项式互补问题转化为光滑化无约束优化问题进行求解,并提出了一种新的光滑化共轭梯度法.在一定假设条件下,证明了该方法的全局收敛性.最后相关的数值实验表明了算法可以有效求解广义多项式互补问题.     

二阶锥线性互补问题的广义模系矩阵分裂迭代算法

通过将二阶锥线性互补问题转化为等价的不动点方程,介绍了一种广义模系矩阵分裂迭代算法,并研究了该算法的收敛性.进一步,数值结果表明广义模系矩阵分裂迭代算法能够有效地求解二阶锥线性互补问题.     

求解线性互补问题的Levenberg-Marquardt型算法

本文考虑了线性互补问题的求解算法,利用一类新的广义互补函数,把线性互补问题转化为非线性方程问题,并且利用Levenberg-Marquardt型算法对转化的问题进行了求解.在一般的假设条件下,给出了所给算法的收敛性分析.最后相关的数值结果表明所给的算法十分有效.     

隐互补约束优化问题的磨光SQP算法

本文提出了一类隐互补约束优化问题的磨光SQP算法.首先,我们给出了这类优化问题的最优性和约束规范性条件.然后,在适当假设条件下,我们证明了算法具有全局收敛性.     

Banach空间内一类广义混合隐平衡问题组解的存在性和迭代算法

在Banach空间内引入和研究了一类新的广义混合隐平衡问题组．首先,对广义混合隐平衡问题组引入了Yosida逼近映射概念．利用此概念,考虑了一个广义方程问题组并证明了它与广义混合隐平衡问题组的等价性．其次,应用广义方程问题组,建议和分析了计算广义混合隐平衡问题组的近似解的迭代算法．在相当温和的条件下,证明了由算法生成的迭代序列的强收敛性．这些结果是新的并且统一和推广了这一领域内的某些最近结果．     

解非线性互补问题的光滑牛顿方法

由于退化解会导致再生方程的奇异性,非线性互补问题的求解通常采用基于半光滑技术的广义牛顿法.基于2-正则性的概念,提出了一类利用光滑互补函数求解互补问题的光滑牛顿算法.算法采用积极集技术,能在解的附近估计出退化指标,并把原问题降阶为一个非奇异方程组,从而保证了迭代效率.算法具有整体收敛性和局部超线性收敛性,数值实验显示算法是有效的.     

随机广义集值隐拟补问题

引入和研究一类随机广义集值隐拟补问题,构造了一个逼近问题解的随机迭代算法.在一定条件下,我们证明了这类问题解的存在性以及由随机算法所产生的序列的收敛性.     

求解广义混合隐拟平衡问题的预测修正算法

引入和研究了一类新的具有四元函数的广义混合隐拟平衡问题．这类平衡问题包含了很多已知的广义平衡问题和广义混合隐拟变分不等式问题作为很特殊的情形．利用辅助原理技巧建议和分析了求解广义混合隐拟平衡问题的预测修正迭代算法．所建议算法的收敛性仅需要映象的连续性和部分松弛强单调性．     

Solvability of Implicit Complementarity Problems

In this paper, a new notion of exceptional family of elements (EFE) for a pair of functions involved in the implicit complementarity problem (ICP) is introduced. Based upon this notion and the Leray–Schauder Alternative, a general alternative is obtained which gives more general existence theorems for the implicit complementarity problem. Finally, via the techniques of continuous selections, these existence theorems are extended to the multi-valued implicit complementarity problems (MIPS).     

一种新的向量互补问题

本文在实局部凸空间中引入了一种新的向量互补问题,这一向量互补问题不仅包含了由Ｙｕ和Ｙａｏ提出的广义向量互补问题由Ｃｈｅｎ和Ｙａｎｇ定义的弱向量互补问题,而且还包含了Ｉｓａｃ意义下的隐互补问题。本文还讨论了新的向量互补问题,向量变分不等式,向量单向极小化问题和最小元问题之间的关系,给出了这一向量互补问题解的存在定理。     

Generalized vector implicit quasi complementarity problems

In this paper, we introduce and study a generalized class of vector implicit quasi complementarity problem and the corresponding vector implicit quasi variational inequality problem. By using Fan-KKM theorem, we derive existence of solutions of generalized vector implicit quasi variational inequalities without any monotonicity assumption and establish the equivalence between those problems in Banach spaces.     

Extragradient methods for differential variational inequality problems and linear complementarity systems

In this paper, 2 extragradient methods for solving differential variational inequality (DVI) problems are presented, and the convergence conditions are derived. It is shown that the presented extragradient methods have weaker convergence conditions in comparison with the basic fixed‐point algorithm for solving DVIs. Then the linear complementarity systems, as an important and practical special case of DVIs, are considered, and the convergence conditions of the presented extragradient methods are adapted for them. In addition, an upper bound for the Lipschitz constant of linear complementarity systems is introduced. This upper bound can be used for adjusting the parameters of the extragradient methods, to accelerate the convergence speed. Finally, 4 illustrative examples are considered to support the theoretical results.     

Stampacchia向量均衡问题与向量相补问题

引进Stampacchia向量均衡问题与一种新的向量相补问题．用数值方法,得到它们的存在定理,并讨论Stampacchia广义向量变分不等式,向量隐相补问题与极小元问题的关系．     

Finding solutions of implicit complementarity problems by isotonicity of the metric projection

Isac and Németh [G. Isac and A. B. Németh, Projection method, isotone projection cones and the complementarity problem, J. Math. Anal. App., 153, 258-275(1990)] proved that solving a coincidence point equation (fixed point problem) in turn solves the corresponding implicit complementarity problem (nonlinear complementarity problem) and they exploited the isotonicity of the metric projection onto isotone projection cones to solve implicit complementarity problems (nonlinear complementarity problems) defined by these cones. In this paper, the notion of *-isotone projection cones is employed and an iterative algorithm is presented in connection with an implicit complementarity problem on *-isotone projection cones. It is proved that if the sequence generated through the defined algorithm is convergent, then its limit is a solution of the coincidence point equation and thus solves the implicit complementarity problem. Sufficient conditions are given for this sequence to be convergent for implicit complementarity problems defined by *-isotone projection cones. The question of finding nonzero solutions of these problems is also studied.     

Implicit complementarity problems on isotone projection cones

Isac and Németh [G. Isac and A. B. Németh, Projection methods, isotone projection cones and the complementarity problem, J. Math. Anal. Appl. 153 (1990), pp. 258–275] proved that solving a coincidence point equation (fixed point problem) in turn solves the corresponding implicit complementarity problem (nonlinear complementarity problem) and they exploited the isotonicity of the metric projection onto isotone projection cones to solve implicit complementarity problems (nonlinear complementarity problems) defined by these cones. In this article an iterative algorithm is studied in connection with an implicit complementarity problem. It is proved that if the sequence generated through the defined algorithm is convergent, then its limit is a solution of the coincidence point equation and thus solves the implicit complementarity problem. Sufficient conditions are given for this sequence to be convergent for implicit complementarity problems defined by isotone projection cones, extending the results of Németh [S.Z. Németh, Iterative methods for nonlinear complementarity problems on isotone projection cones, J. Math. Anal. Appl. 350 (2009), pp. 340–370]. Some existing concepts from the latter paper are extended to solve the problem of finding nonzero solutions of the implicit complementarity problem.     

求解一类隐线性互补问题的投影MAOR算法

用MAOR迭代算法求解一类L-矩阵的隐线性互补问题.证明了由此算法产生的迭代序列的聚点是隐线性互补问题的解.并且当问题中的矩阵是M-矩阵时,算法产生的迭代序列单调收敛于隐互补问题的解.     

Simultaneous Subgradient Algorithms for the Generalized Split Variational Inclusion Problem in Hilbert Spaces

In this article, we study the generalized split variational inclusion problem. For this purpose, motivated by the projected Landweber algorithm for the split equality problem, we first present a simultaneous subgradient extragradient algorithm and give related convergence theorems for the proposed algorithm. Next, motivated by the alternating CQ-algorithm for the split equality problem, we propose another simultaneous subgradient extragradient algorithm to study the general split variational inclusion problem. As applications, we consider the split equality problem, split feasibility problem, split variational inclusion problem, and variational inclusion problem in Hilbert spaces.