1) convex feasibility problem
凸可行问题
1.
Gradient projection algorithm for solving the convex feasibility problem
凸可行问题的一种次梯度投影算法
2.
Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modevn physical sciences,algorithms for solving convex feasibility problems continue toreceive great attention.
凸可行问题(CFP)是传统数学及现代自然科学中的一类重要问题,其应用日益广泛。
2) convex feasibility problem
凸可行性问题
1.
A new algorithm named m-steps modified relaxed projection method is constructed to solve the convex feasibility problem.
在松弛投影法的基础上,用超平面来代替凸集,充分利用已经求出的最优参数,构造出一种新的解决凸可行性问题的算法,即m步修正松弛投影法,并证明了该算法是强收敛的。
3) feasibility problem
可行问题
1.
Projection algorithm for the quasiconvex feasibility problem
拟凸可行问题的投影算法
4) infeasibility detection and handling
不可行问题
1.
The infeasibility detection and handling strategy is discussed while the prime\|dual interior point method is used.
分析了电力系统电压无功实时优化控制中出现的不可行问题，通过引入模糊约束，从一个新的角度对不可行问题进行了处理，最终获得尽量靠近原不等式约束空间的解。
5) split feasibility problem
分裂可行问题
1.
In this paper,a modification of the relaxed CQ algorithm is given by adopting an Armijo-like searching rule for solving the split feasibility problem.
主要对解决分裂可行问题的松驰CQ算法进行修正,设计了一种新的算法。
6) The linear feasibility problem
线性可行问题
补充资料：凸凸
1.高出貌。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条