1) Closed convex domain
闭凸集约束
1.
Simple Algorithm for Single Location in a Closed Convex Domain;
具闭凸集约束选址问题的简捷算法
2) Projection onto Convex Set(POCS)Restriction
凸集投影(POCS)约束
3) closed constrained frequent itemsets
闭约束频繁项集
4) reverse convex constraint
反凸约束
1.
Convex programs with an additional reverse convex constraint;
带一个反凸约束的凸规划问题
2.
In this paper, we are concerned with a class of global optimization problem (P) with a reverse convex constraint:global minf(x)=CTx, subject to x∈D={x|h(x)≤0}, g(x)≥0where C∈Rn, g(x),h (x) are convex finite functions on Rn.
讨论一类带有一个反凸约束的全局规划（Ｐ）：ｇｌｏｂａｌｍｉｎｆ（ｘ）＝ＣＴｘ，ｓ。
3.
Conical subdivision method for concave programs to convex programs with an additional reverse convex constraint was applied.
将凹规划问题的锥剖分方法应用于带有一个反凸约束的凸规则，得到了一个锥分解算法，并证明了算法的收敛性。
5) convex constrained
凸约束
1.
An unconstrained nonmonotone line search algorithm is generalized to the one with convex constrained,the search direction dk determined by BFGS method is replaced by the one determined by the equations which satisfy the convex constrained conditions,and testify the global convergence and k-linear convergence for this algorithm.
将一般的无约束非单调线搜索算法推广成凸约束的非单调线搜索法,搜索方向由BFGS方法改变为满足凸约束条件的方程组来确定,证明了算法的全局收敛性和k次线性收敛,进行了数值试验,结果表明算法十分有效。
2.
In this paper, we presented the nonmonotone projected Levenberg-Marquardt method for solving convex constrained nonliear equations.
在考虑凸约束非线性方程组的收敛性时，多数论文均在非奇异的假设下讨论。
6) nonconvex constraint
非凸约束
1.
This paper proved the existence of bounded solutions for this kind Plateau problem by solving a local minimizing problem with nonconvex constraint via the calculus of variation,equation with measures and prior estimates.
应用变分方法，综合利用先验估计，含测度的方程，该文通过求解一个具有非凸约束的局部极小化问题，得到所考虑的Ｐｌａｔｅａｕ问题的有界解之存在性。
补充资料：凸凸
1.高出貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条