随机P矩阵和随机P0矩阵线性互补问题

定义了随机P矩阵和随机P0矩阵,给出了矩阵为随机P矩阵或随机P0矩阵的充要条件.研究了随机线性互补问题(SLCP)的矩阵为随机P矩阵时,期望残差方法(ERM)解集的有界性.得到了期望矩阵为P矩阵时,(ERM)解集非空有界.并且研究离散情形(ERM)与期望值方法(EV)解的关系,给出了(ERM)解唯一的条件.     

解一类线性互补问题的区间方法

1引言线性互补问题简记为LCP(M,q)是指对给定的n×n阶实方阵M和N维实向量q,求满足下列条件的实向量x：x≥0,Mx q≥0,(1．1) x~T(Mx q)=0．它在工程物理、管理学、经济学、约束最优化等领域有着广泛的应用背景．备受人们关注     

一类线性互补问题的最小元算法

本文对M∈Z时的线性互补问题提出一种新的算法——最小元算法.此算法比现行的R.Chandrasekaran算法和化这类问题成线性规划问题的方法具有更广的适用范围,而且对于退化情形仍然有效.     

一类线性互补问题解存在性判断的区间方法

利用目标函数的区间斜量,以Miranda定理为理论依据,将Moore-Kioustelidis定理推广到不可微情况,提出了一类线性互补问题解存在性判断的区间方法,给出了具体实例,表明这种判断方法是有效的.     

线性互补问题与多目标优化

本文研究了求解线性互补问题的一类新方法:把线性互补问题转化为多目标优化问题,利用多目标优化有效解的定义,给出了零有效解的概念;进而获得多目标优化问题的零有效解就是线性互补问题的最优解.最后给出了有解、无解线性互补问题,并分别把这些问题转化为多目标优化,采用极大极小方法求解转化后的多目标优化问题.数值实验结果表明了该方法的正确性和有效性,完善了文献[19]的数值结果.     

关于线性互补问题的一个直接法

一类交分不等式问题通过有限差分法或有限元法离散可归为线性互补问题:     

求解随机广义纳什均衡问题的样本均值方法

研究随机广义纳什均衡问题.给出了随机广义纳什均衡问题变分不等式形式的再定式.利用期望残差最小化方法,获得了求解该问题的一种新的模型.并通过拟蒙特卡罗方法给出了该模型的求解方法.     

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

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

单调线性互补问题的最小原则(Ⅰ)

本文的主要结果可概括为以下两部分：１．在文［１］基础上给出单调线性互补问题（ＭＬＣＰ）最小原则的形式和提出在有限步内可求出ＭＬＣＰ解集的两种方法；２．导出仅用ＭＬＣＰ的一个解的梯度和约束集即可刻划ＭＬＣＰ解集的充要条件．     

一类非单调线性互补问题的高阶仿射尺度算法

In this paper, a new interior point algorithm-high-order atone scaling for a class of nonmonotonic linear complementary problems is developed. On the basis of idea of primal-dual affine scaling method for linear programming , the search direction of our algorithm is obtained by a linear system of equation at each step . We show that, by appropriately choosing the step size, the algorithm has polynomial time complexity. We also give the numberical results of the algorithm for two test problems.     

随机线性互补问题的无约束优化再定式

针对随机线性互补问题,提出等价的无约束优化再定式模型,即由D-间隙函数定义的确定性的无约束期望残差极小化问题.通过拟Monte Carlo方法,将样本进行了推广,得到了相关的离散近似问题.在适当的条件下,提出了最优解存在的充分条件,以及探究了离散近似问题的最优解及稳定点的收敛性.另外,在针对一类带有常系数矩阵的随机互补线性问题,研究了解存在的充要条件.     

Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems

We consider a class of stochastic linear complementarity problems (SLCPs) with finitely many realizations. In this paper we reformulate this class of SLCPs as a constrained minimization (CM) problem. Then, we present a feasible semismooth Newton method to solve this CM problem. Preliminary numerical results show that this CM reformulation may yield a solution with high safety for SLCPs.     

线性互补问题均衡解的存在形式与识别方法

研究了线性互补问题均衡解的存在形式与判定方法,给出了线性互补问题有解的充要条件,得到了带有几类特殊系数矩阵的线性互补问题的解的性质.在此基础上设计了求解线性互补问题均衡解的直接算法.     

Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems

Most existing interior-point methods for a linear complementarity problem (LCP) require the existence of a strictly feasible point to guarantee that the iterates are bounded. Based on a regularized central path, we present an infeasible interior-point algorithm for LCPs without requiring the strict feasibility condition. The iterates generated by the algorithm are bounded when the problem is a P _* LCP and has a solution. Moreover, when the problem is a monotone LCP and has a solution, we prove that the convergence rate is globally linear and it achieves `-feasibility and `-complementarity in at most O(n ² ln(1/`)) iterations with a properly chosen starting point.     

关于线性互补问题解的存在性

讨论线性互补问题解的存在性。证明关于解的唯一性定理。用反例表明:对于线性互补问题解的存在性,"M是半正定矩阵"既不是充分条件,也不是必要条件。     

Modulus-Based GSTS Iteration Method for Linear Complementarity Problems

In this paper, a modulus-based generalized skew-Hermitian triangular splitting (MGSTS) iteration method is present for solving a class of linear complementarity problems with the system matrix either being an $H_+$-matrix with non-positive off-diagonal entries or a symmetric positive definite matrix. The convergence of the MGSTS iteration method is studied in detail. By choosing different parameters, a series of existing and new iterative methods are derived, including the modulus-based Jacobi (MJ) and the modulus-based Gauss-Seidel (MGS) iteration methods and so on. Experimental results are given to show the effectiveness and feasibility of the new method when it is employed for solving this class of linear complementarity problems.     

M-矩阵线性互补问题模系多分裂迭代方法的收敛性

首先证明了M-矩阵的H-相容分裂都是正则分裂,反之不成立.这表明对于M-矩阵而言,其正则分裂包含H-相容分裂.然后针对系数矩阵为M-矩阵的线性互补问题,建立了两个收敛定理:一是模系多分裂迭代方法关于正则分裂的收敛定理;二是模系二级多分裂迭代方法关于外迭代为正则分裂和内迭代为弱正则分裂的收敛定理.     

求解线性互补问题的同伦方法

It is well known that a linear complementarity problem (LCP) can be formulated as a system of nonsmooth equations F(x) = 0, where F is a map from Rninto itself. Using the aggregate function, we construct a smooth Newton homotopy H(x,t) = 0. Under certain assumptions, we prove the existence of a smooth path defined by the Newton homotopy which leads to a solution of the original problem, and study limiting properties of the homotopy path.