1) P_*(κ) linear complementary problem
P*(κ)性互补问题
2) P*(κ)-matrix linear complementarity problem
P*(κ)阵线性互补问题
1.
Via least value of proximity measure function,a new wide-neighborhood predictor-corrector interior-point algorithm for P*(κ)-matrix linear complementarity problem is proposed,we also prove that its iteration complexity is O((κ+1)32nlog(x0)Ts0ε).
基于邻近度量函数的最小值,对P*(κ)阵线性互补问题提出了一种新的宽邻域预估-校正算法,在较一般的条件下,证明了算法的迭代复杂性为O(κ+1)23n log(x0ε)Ts0。
3) P (κ) matrices horizontal linear complementarity problems
P_＊(κ)阵水平线性互补问题
4) P-function nonlinear complementarity problem
P-函数非线性互补问题
1.
A new interior point wide-neighborhood predictor-corrector algorithm for a class of P-function nonlinear complementarity problem is presented.
针对一类P-函数非线性互补问题,提出了一种新的内点算法——宽邻域预估校正算法。
5) P *(k)-matrice linear complementarity problem
P*(k)阵线性互补问题
6) P. (K)-matrix linear complementarity problem
P.(K)-矩阵线性互补问题
补充资料：三丁氧基(2,4-戊二酮根合-κO,κO')-锆
CAS：85626-36-4
中文名称：三丁氧基(2,4-戊二酮根合-κO,κO')-锆
英文名称：tributoxy(2, 4-pentanedionato-.kappa.O, .kappa.O')-Zirconium； Zirconium,tributoxy(2,4-pentanedionato-.kappa.O,.kappa.O')-
中文名称：三丁氧基(2,4-戊二酮根合-κO,κO')-锆
英文名称：tributoxy(2, 4-pentanedionato-.kappa.O, .kappa.O')-Zirconium； Zirconium,tributoxy(2,4-pentanedionato-.kappa.O,.kappa.O')-
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条