对非线性互补问题（Nonlinear Complementarity Problem），提出新的整体收敛的算法，并用大量算例说明了算法的有效性，此成果发表在《Journal of Computational Mathematics》，被SCI收录...
基于20个网页-相关网页
...x T ·f (x, y) =0 的互补 条件和一些等式构成的，这样就构成了一个混合的 非线性互补问题（Nonlinear Complementarity Problem，NCP）。
基于2个网页-相关网页
the mixed nonlinear complementarity problem 混合非线性互补问题
the nonlinear complementarity problem 非线性互补问题
the extended nonlinear complementarity problem 广义非线性互补问题
mixed nonlinear complementarity problem 混合非线性互补问题
general nonlinear complementarity problem 广义互补问题
monotone nonlinear complementarity problem 单调非线性互补问题
vertical nonlinear complementarity problem 直交非线性互补问题
以上来源于: WordNet
In chapter 2, the generalized nonlinear complementarity problem (GNCP) defined on a polyhedral cone is reformulated as a system of nonlinear equations.
第二章主要是将求解定义在闭凸多面锥上的广义互补问题(GNCP)转化为一个非线性方程组问题。
In convex programming theory, a constrained optimization problem, by KT conditions, is usually converted into a mixed nonlinear complementarity problem.
在凸规划理论中，通过KT条件，往往将约束最优化问题归结为一个混合互补问题来求解。
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.
利用凝聚函数一致逼近非光滑极大值函数的性质，将非线性互补问题转化为参数化光滑方程组。
应用推荐