考虑了单调的水平线性互补问题。
The monotone horizontal linear complementarity problem is considered in this paper.
目的研究用辅助问题方法求解隐互补问题。
Objective: To study auxiliary problem method for solving implicit complementarity problems.
讨论了单调线性互补问题解的结构及性质。
The structure and properties of monotone linear complementarity problems are studied.
把解互补问题转化为求非线性映照的不动点。
Firstly, solving complementarity problems is changed into finding a nonlinear mapping's fixed point.
对互补问题解的存在性提出了一种区间检验。
In this paper, an interval method is proposed to test the existence of solution to complementarity problems.
因此，对互补问题算法的研究具有重要意义。
Therefore, it is significant to investigate algorithms for solving these problems.
结果得到了当m是广义正定矩阵时，线性互补问题存在唯一解。
Results linear complementary problem have unique solution when m is generalized positive definite matrix.
第三章为广义非线性互补问题的自适应信赖域方法。
In chapter 3, we present a self-adaptive trust region method for solving generalized nonlinear complementarity problems.
用MAOR迭代算法求解一类L -矩阵的隐线性互补问题。
The MAOR iterative algorithm is used to solve an implicit linear complementarity problem with L-matrix.
本文给出互补问题解的存在性的一个充分条件，其证明是构造性的。
A sufficient condition that the complementarity problem has solution is given in this paper, the proof of existence is constructive.
文章给出了求解这类隐式互补问题的直接迭代法，并给出了数值结果。
The article presents the direct iterative algorithm for this problem and provides numerical results.
广义互补问题是互补问题的推广，它在工农业生产等实际问题中有重要的应用。
The generalized nonlinear complementarity problem is the extension of the classical nonlinear complementarity problem. It is very important and useful in industrial and agricultural production.
广义互补问题是互补问题的推广，它在工农业生产等实际问题中有重要的应用。
The generalized nonlinear complementarity problems are the extension of the classical nonlinear complementarity problems. They are very important and useful in industrial and agricultural production.
本文构造了广义线性互补问题的一个光滑价值函数，该函数具有良好的微分性质。
In this paper, a smooth merit function is constructed for general linear complementarity problem (GLCP), which possesses fine coercive property.
基于广义互补问题的半光滑方程组变形，给出了求解广义互补问题的一种新算法。
Based on a semi smooth equations reformulation of the generalized complementarity problem, a new algorithm is presented.
实验结果表明，该算法收敛速度快，稳定性好，是求解非线性互补问题的一种有效算法。
The imitate results manifest that SCO converges fast and stably, and it is an effective algorithm for NCP.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
提出了求解非线性互补问题的一个光滑逼近算法，在一定条件下证明了该算法的全局收敛性。
A smoothing approximation algorithm for nonlinear complementarity problems was introduced and the global convergence of the algorithm was proved under milder conditions.
利用凝聚函数一致逼近非光滑极大值函数的性质，将非线性互补问题转化为参数化光滑方程组。
By using a smooth aggregate function to approximate the non-smooth max-type function, nonlinear complementarity problem can be treated as a family of parameterized smooth equations.
本文引入了几类向量f -互补问题并给出了向量f -互补问题与广义向量变分不等式之间的关系。
In this paper, we introduce several classes of vector F-complementarity problems and give relations between vector F-complementarity problems and general vector variational inequality problems.
第二章主要是将求解定义在闭凸多面锥上的广义互补问题(GNCP)转化为一个非线性方程组问题。
In chapter 2, the generalized nonlinear complementarity problem (GNCP) defined on a polyhedral cone is reformulated as a system of nonlinear equations.
线性互补问题在经济学、对策论和数学规划领域中有广泛的应用，线性互补问题解的存在性与特殊矩阵密切相关。
The linear complementarity problem was very useful in economics, it was widely used in game theory and mathematical programming.
针对非线性互补问题，提出了与其等价的非光滑方程的一个下降算法，并在一定条件下证明了该算法的全局收敛性。
This paper presents a new descend algorithm for nonlinear complementarity problems. The global convergence of the algorithm is proved under milder conditions.
进一步研究扩展的垂直线性互补问题，即将线性互补问题中的P性质在扩展的垂直线性互补问题中推广为V P性质。
We extend P_property in the linear complementarity problem to V_P property in the extended vertical linear complementarity problem.
把高维线性互补问题转化为与之等价的高维二次规划问题，然后把高维二次规划问题分解为一系列低维二次规划问题。
The higher dimensional linear complementary problem is transformed into quadratic (programming), and then decomposed into a series of lower dimensional quadratic programming.
针对这一优化问题，通过引入非线性互补问题函数，将原优化问题转化为非线性方程组，并采用半光滑牛顿法进行求解。
By introducing nonlinear complementarity problem function, the original optimization problem is transferred equivalently to a set of nonlinear equations and solved by semi-smooth Newton method.
在一定的条件下我们证明了非线性互补问题的解是该微分方程系统的平衡点，并且证明了该微分方程系统的稳定性和全局收敛性。
We prove that the solution of a nonlinear complementarity problem is exactly the equilibrium point of differential equation system, and prove the asymptotical stability and global convergence.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
By using Newton direction and centering direction, we establish a feasible interior point algorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.
利用牛顿方向和中心路径方向，获得了求解单调线性互补问题的一种内点算法，并证明该算法经过多项式次迭代之后收敛到原问题的一个最优解。
By using Newton direction and centering direction, we establish a feasible interior point algorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.
应用推荐