1) Four neighborhood pixels algorithm
四邻接点算法
2) Neighborhood-pixels algorithm
邻接点算法
3) The algorithm of adjacent nodes
邻接结点算法
4) proximal point algorithm
邻近点算法
1.
The convergence analysis of an approximate proximal point algorithm for monotone variational inequalities
求解单调变分不等式的近似邻近点算法的收敛性分析
2.
Proximal point algorithms(PPA) arc attractive methods solving monotone variational inequalities(VI).
邻近点算法(PPA)是求解单调变分不等式的一种常用的有效方法。
3.
An approximate proximal point algorithm for solving monotone variational inequalities is constructed,and the convergence of the algorithm is proved under the condition that any indirect step is not required.
给出求解单调变分不等式问题的一个近似邻近点算法,在不需要任何中间步骤的条件下证明算法的收敛性。
5) proximal point algorithms
邻近点算法
1.
In order to solve the problem of set valued mapping equation 0∈T(z),where T is a maximal monotone operator,a new-approximate proximal point algorithms(N-APPA) was given in R~n:For x~k and β_k>0,let x~(k+1)=P_Ω[~k-e~k] with x~k+e~k∈~k+β_kT(~k),‖e~k‖≤η_k‖x~k-~k‖,where (sup)k>0?η_k<1,Ω is domain of T,P_Ω(·) is a projection operator on Ω.
对于求解集值映射方程0∈T(z)问题(其中T为极大单调算子),在Rn中有一种新的邻近点算法(NAPPA):对给定的xk及βk>0,取xk+1=PΩ[ xk-ek],满足xk+ek∈ xk+βkT( xk),‖ek‖≤ηk‖xk- xk‖。
2.
In this dissertation, we focus on adapting proximal point algorithms to solve set-valued equations, variational inequalities problems and optimization problems.
本文主要研究用邻近点算法求解集值映射方程，变分不等式问题和最优化化问题。
6) wide-neighborhood interior point
宽邻域内点算法
1.
An algorithm of wide-neighborhood interior point for a class of non-monotonic linear complementary problems;
一类非单调线性互补问题的宽邻域内点算法
补充资料：四邻
1.犹四辅。天子左右的大臣。 2.四方邻国。 3.周围邻居。 4.四方;周围。 5.指周围邻近的人。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条