可行点

In this paper, the feasibilities and approaches to detect and identify warship aimpoint are studied, such as midpoints of waterline, bridge house, and engine cabin, by use of the contour, shape specific points, thermal regions, geometry relationship etc., of warship′s long wave infrared image.

利用舰船目标长波红外图像的轮廓、形殊点、热源和几何关系等多种信息，对检测识别目标的吃水线中点，舰桥和动力舱这些要害点的可行性和方法进行了研究，初步的实验结果证实了文中的方法和算法是可行和有效的

Finally, we get a necessary condition under which the distance between a feasible sequence and the KT point set converges to zero.

最后，还给出了可行解点列至KT点集的距离趋于零的必要条件。

Moreover, It's proved that if the initial point is the interior point of hypercube and steplength is confined to (0,1) when carrying out one dimension search following the direction mentioned above in order to generate next point, then any point generated by such iteration is interior point of feasible field.

在求解加辅助项模型的过程，作者找到一个很好的下降方向，并证明了只要初始点在超方体的内部选取，沿着上述的下降方向进行一维搜索时的步长限定在(0，1)范围内，那么迭代点始终保持在可行域内部。

We improved the merit function in quasi-feasible interior point method and used the exponential function that is the more general function to prove the existence of one order optimality point in feasible problem. We discussed the inner and outer algorithms and made the convergence theorem.

在算法中改进了拟可行内点法中的值函数，使用指数形式的更一般函数，用此值函数证明了可行性问题的一阶最优性点的存在性，并通过对内部算法及外部算法的讨论得到了算法的收敛性定理。

In the algorithm,a kind of merit function and the schemes of nonmono-tone line search are used to have the algorithm be of the global convergence andsuperlinear convergence and have the algorithm be of a extended application range,especially at time of the feasible initial point is hard to be obtained.

该方法适用于任意的起始点。并且使用了一类效益函数，ε—积极约束策略及非单调线搜索，从而使算法保持了整体收敛性和局部超线性收敛性，并具有较广的适用范围，尤其在可行的起始点难于得到的情况下。

After finite iterations, the iteration point gets into the feasible set and the master direction is a feasible direction of descent.

有限次迭代后，迭代点进入可行集且主方向是一可行下降方向。

Under the assumption that the feasible region of the problem is n dimension, if the algorithm is terminated after finite step, the point obtained must be a global optimal solution of the problem, else each accumulation point of sequence {vk} which the algorithm produces must be a global optimization solution of the problem.

在问题的可行域是n维的条件下，如果这个算法有限步后终止，得到的点必是问题的整体最优解；否则，该算法产生的点的序列{vk}的每一个聚点也必是问题的整体最优解。

Secondly, the relevance feedback approach requires relevant documents to be similar to each other. That is, they should cluster. Ideally, the term distribution in all relevant documents will be similar to that in the documents marked by the users, while the term distribution in all nonrelevant documents will be different from those in relevant documents. Things will work well if all relevant documents are tightly clustered around a single prototype, or, at least, if there are different prototypes, if the relevant documents have significant vocabulary overlap, while similarities between relevant and nonrelevant documents are small.

第二，相关反馈方法需要相关文档之间相似，即它们可以聚类，理想地，所有相关文档 term 分布应该相似，相关档即用户标记的文档，同时不相关文档应该与相关文档的 term 分布不同，如果所有的相关文档都很紧凑地聚在一个单一的中心点，或至少有不同的中心点，如果相关文档有明显的词汇重复，同时相关与不相关文档相似性比较小，它才是可行的。

The projection gradient method will be a possible way to solve the problem that we just get. It has been shown that the projections of the every directions, of which is the boundary point in linear restraint problems, are the possible decent directions, and the projection of negative grads direction is a decent direction. In 1960, Rosen proposed the basic idea of projection gradient methods, and then lots of researchers have been tried to find the convergence of this method. But most of them get the convergence with the condition to amend the convergence itself.

在约束最优化问题的算法中怎样寻找有效的下降方向是构造算法的重要内容，在寻找下降方向方面可行方向法中的投影梯度法有效的解决了下降方向的寻找问题，利用线性约束问题边界点的任意方向在边界上的投影都是可行方向，而负梯度方向的投影就是一个下降方向。60年代初Rosen提出投影梯度法的基本思想，自从Rosen提出该方法以后，对它的收敛性问题不少人进行了研究，但一般都是对算法作出某些修正后才能证明其收敛的，直到最近对Rosen算法本身的收敛性的证明才予以解决。

In each step the tangent plane of limit state surface at the previous iterative point is calculated firstly, and then a line from origin to a point on the plane is determined whose intersection with limit state surface satisfies the requirement of feasible direction and convergence.

算法在每步迭代中先计算极限状态曲面在前步迭代点处的切平面，然后在此切平面上选定一个点，使该点和原点的连线与极限状态曲面的交点满足可行方向和收敛的要求。

And Pharaoh spoke to Joseph, saying, Your father and your brothers have come to you.

47：5 法老对约瑟说，你父亲和你弟兄们到你这里来了。

Additionally, the approximate flattening of surface strip using lines linking midpoints on perpendicular lines between geodesic curves and the unconditional extreme value method are discussed.

提出了用测地线方程、曲面上两点间短程线来计算膜结构曲面测地线的方法，同时，采用测地线间垂线的中点连线和用无约束极值法进行空间条状曲面近似展开的分析。