【摘要】 基于凝聚函数,提出一个求解垂直线性互补问题的光滑Newton法·　该算法具有以下优点:(ⅰ)每次迭代仅需解一个线性系统和实施一次线性搜索;(ⅱ)算法对垂直分块P0矩阵的线性互补问题有定义且迭代序列的每个聚点都是它的解·　而且,对垂直分块P0+R0矩阵的线性互补问题,算法产生的迭代序列有界且其任一聚点都是它的解;(ⅲ)在无严格互补条件下证得算法即具有全局线性收敛性又具有局部二次收敛性·　许多已存在的求解此问题的光滑Newton法都不具有性质(ⅲ)·更多还原

【Abstract】 A one_step smoothing Newton method is proposed for solving the vertical linear complementarity problem based on the so_called aggregation function.The proposed algorithm has the following good features:(ⅰ) it solves only one linear system of equations and does only one line search at each iteration; (ⅱ) it is well_defined for the vertical linear complementarity problem with vertical block P0 matrix and any accumulation point of iteration sequence is its solution.Moreover,the iteration sequence is bounded for the vertical linear complementarity problem with vertical block P0+R0 matrix; (ⅲ) it has both global linear and local quadratic convergence without strict complementarity.Many existing smoothing Newton methods do not have the property(ⅲ).更多还原