求解一类非单调线性互补问题的路径跟踪法及其计算复杂性

１．引言及记号 线性互补问题的一般形式是;求（ｘ,ｓ） 　　　　　　　 使其中 众所周知,当Ω＋非空时,单调线性互补问题可在多项式时间内求解,而且人们已经设计出了多种求解单调线性互补问题的有效的内点算法（见［１］和［７］）．然而,对于求解非单调线性互补问题的内点算法的研究可以说才刚刚开始．文［２］讨论了当Ｍ为Ｐ矩阵时问题（１）的中心路径的存在唯一性;文［３］给出了设计求解一类非单调线性互补问题的内点算法的一般框架;文［４］给出了求解一类非单调线性互补问题的一种势能函数约减法并讨论了其算法的计算复杂…     

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

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

求解退化单调线性互补问题极大互补解的复杂性

本文考虑求解退化单调线性互补问题的一类不可行内点算法，其中嵌入一个恢复算法，给出了用这类算法产生所考虑问题的一个精确极大互补解的复杂性．     

一个求解单调线性互补问题的高阶不可行内点算法

本文通过使用相同的矩阵因子，给出了一个求解单调线性互补问题的r-阶Mehrotra型宽城不可行内点算法，其中嵌入Wright的快速步与安全步算法．所给算法的迭代复杂性为O（n~((r 1)/r)L）．在考虑的问题有一个严格互补解的条件下，所给算法具有2阶Q-超线性收敛性．     

一个求解二阶锥互补问题的非单调光滑算法北大核心

光滑算法是求解二阶锥互补问题非常有效的方法,而这类算法通常采用单调线性搜索.给出了一个求解二阶锥互补问题的非单调光滑算法,在不需要满足严格互补条件下证明了算法是全局和局部二阶收敛的.数值试验表明算法是有效的.     

一个求解二阶锥互补问题的非单调光滑算法

光滑算法是求解二阶锥互补问题非常有效的方法,而这类算法通常采用单调线性搜索.给出了一个求解二阶锥互补问题的非单调光滑算法,在不需要满足严格互补条件下证明了算法是全局和局部二阶收敛的.数值试验表明算法是有效的.     

例外簇与线性互补问题的存在性定理

1．简介给定一n×n阶矩阵M和一n维向量q，由M和q决定的线性互补问题是求得一向量x∈Rn使下式成立：问题（1）简记为LCP（q；M）．［1］对此问题作了详细的介绍，其中一个重要专题是研究（1）的解存在性问题：在何种条件下，LCv（q，wr）有解．山给出了各种存在性定理如：当wr是正定矩阵时，对任一qeR”，LCP（q，M）都有唯一解，这一结果被推广到P一矩阵，当M为（严格）半单调矩阵及q（三）＞0时，LCP（q，M）只有零解；当M为协正定阵时，q限制于某一集合时，LCP（q，M）有解等．所有上述结果都源于线性互补问题的二次等价形式及…     

一类带非单调搜索的SQP算法

本文给出了一个SQP新算法，其特点是使用了非单调搜索，并不再使用严格互补条件，使得算法在一定阶段后具有十分简洁的形式并保持整体收敛与超线性收敛性．     

S-Sparse Ostrowski-Brauer矩阵线性互补问题的误差界及其应用（英文）

本文研究S-Sparse Ostrowski-Brauer (S-SOB)矩阵线性互补问题误差界的估计问题.利用矩阵不等式放缩技术及S-SOB矩阵逆矩阵无穷大范数,获得S-SOB矩阵线性互补问题的误差界,该界仅依赖于S-SOB矩阵的元素.在此基础上,给出S-SOB-B矩阵线性互补问题的误差界,并从理论上证明所给误差界在一定条件下优于García-Esnaola等(2009)和LIU等(2021)所给的结果.最后,通过数值算例进一步阐明了结果的有效性.     

求解一类非单调线性互补问题的宽邻域内点方法及其计算复杂性

对于一类非单调线性互补问题给出了一种新的算法——宽邻域内点算法，并讨论了其计算复杂性。     

A two-step matrix splitting method for the mixed linear complementarity problem

In this paper, on the base of the methodology of the new modulus-based matrix splitting method in [Optim. Lett., (2022) 16:1427-1443], we establish a two-step matrix splitting (TMS) method for solving the mixed linear complementarity problem (MLCP). Two sufficient conditions to ensure the convergence of the proposed method are presented. Numerical examples are provided to illustrate the feasibility and efficiency of the proposed method.     

Resolving degeneracy in quadratic programming

A technique for the resolution of degeneracy in an Active Set Method for Quadratic Programming is described. The approach generalises Fletcher's method [2] which applies to the LP case. The method is described in terms of an LCP tableau, which is seen to provide useful insights. It is shown that the degeneracy procedure only needs to operate when the degenerate constraints are linearly dependent on those in the active set. No significant overheads are incurred by the degeneracy procedure. It is readily implemented in a null space format, and no complications in the matrix algebra are introduced.The guarantees of termination provided by [2], extending in particular to the case where round-off error is present, are preserved in the QP case. It is argued that the technique gives stronger guarantees than are available with other popular methods such as Wolfe's method [11] or the method of Goldfarb and Idnani [7].Presented at the 14th International Symposium on Mathematical Programming, Amsterdam, August 5–9, 1991.     

与P矩阵和LCP有关的量(英文)

发展了与P矩阵有关的基本量的一些新性质,并且改进了由Xiu和Zhang[A characteristic quantity ofP-matrices,Appl.Math.Lett.,2002,15:41-46]提出的水平线性余问题全局误差上限.     

有关E'-矩阵的若干注记

The class of E'-matrices introduced in [4] is a subclass of Q0-matrices whose proper principal submatrices are Q-matrices. In this paper, we investigate the relation of the class E' to other known matrix classes and obtain a series of necessary and sufficient conditions for E'-matrices.     

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

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

An O(n 3 L) adaptive path following algorithm for a linear complementarity problem

In this paper we propose an O(n ³ L) algorithm which is a modification of the path following algorithm [8] for a linear complementarity problem. The path following algorithm has to take a short step size in each iteration in order to bound the number of overall arithmetic operations by O(n ³ L). In practical computation, we can determine the step size adaptively. Mizuno, Yoshise, and Kikuchi [11] reported that such an adaptive algorithm required about O(L) iterations for some test problems. Here we show that we can use a rank one update technique in the adaptive algorithm so that the number of overall arithmetic operations is theoretically bounded by O(n ³ L).Research supported in part by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.Research supported in part by NSF grants ECS-8602534 and DMS-8904406 and ONR contract N-00014-87-K0212.     

Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods

A family of complementarity problems is defined as extensions of the well-known linear complementarity problem (LCP). These are:

Levenberg-Marquardt method with a general LM parameter and a nonmonotone trust region technique

We propose a new Levenberg-Marquardt (LM) method for solving the nonlinear equations. The new LM method takes a general LM parameter \lambda_k=\mu_k[(1-\theta)\|F_k\|^\delta+\theta\|J_k^TF_k\|^\delta] where \theta\in[0,1] and \delta\in(0,3) and adopts a nonmonotone trust region technique to ensure the global convergence. Under the local error bound condition, we prove that the new LM method has at least superlinear convergence rate with the order \min\{1+\delta,4-\delta,2\}. We also apply the new LM method to solve the nonlinear equations arising from the weighted linear complementarity problem. Numerical experiments indicate that the new LM method is efficient and promising.     

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

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