1) break line search
折线搜索
2) line search
线搜索
1.
Global convergence of a conjugate gradient method with strong Wolfe-Powell line search;
强Wolfe-Powell线搜索下共轭梯度法的全局收敛性
2.
Global convergence properties of CD conjugate gradient method with a new line search;
一种新的线搜索下CD型共轭梯度法的全局收敛性
3.
Global convergence property of DFP method with Goldstein line search;
Goldstein线搜索下DFP算法的全局收敛性
3) search antenna
搜索天线
1.
The search antenna system of the fire control radar increases the performances of fire-control radar through widening the beam broadening in elevation radiation pattern ,and become to shadow antenna,and increases the high frequency amplifier.
"炮瞄雷达搜索天线系统"在原某型炮瞄雷达的基础上,通过展宽其垂直方向的波束宽度,使其成为赋型天线,并加装高放,来提高炮瞄雷达的性能。
4) Wolfe line search
Wolfe线搜索
1.
A new conjugate gradient method is proposed for solving unconstrained optimization problems to update and prove the method with Wolfe line search convergece globally.
提出了求解无约束优化问题的一种新的共轭梯度法,修正了βk,并在Wolfe线搜索下证明了它的全局收敛性。
2.
The convergence of the new methods is proved under the Wolfe line search without the descent condition.
本文对求解无约束优化问题提出一类三项混合共轭梯度算法,新算法将Hestenes- stiefel算法与Dai-Yuan方法相结合,并在不需给定下降条件的情况下,证明了算法在Wolfe线搜索原则下的收敛性,数值试验亦显示出这种混合共轭梯度算法较之HS和PRP的优势。
3.
Under mild conditions, we prove that the method possesses descent property and is global convergence with the strong Wolfe line search.
在适当的条件下,证明了算法具有下降性质,并且在采用强Wolfe线搜索时,算法是全局收敛的。
5) line search
线性搜索
1.
In order to reduce the computational complexity of the fast motion estimation and improve the accuracy of motion compensation, a new block-matching algorithm called line-square search (LSS) algorithm was proposed, in which the strategy of the line search was introduced.
该算法采用运动估计的线性搜索策略,对于不重要的搜索区域利用线性搜索技术进行快速搜索以减小算法的计算复杂度,而对于重要搜索区域,即最佳点所在区域,用9点的正方形模块进行精细搜索以提高算法的搜索精度。
2.
By combiming a derivativefree line search with the projected heasian SQP methods,a quasiNewton method for solving equality constrained optimization problems was proposed.
将单边既约Hesse矩阵SQP方法和无导数线性搜索技术相结合,提出了一种求解等式约束最优化问题的拟牛顿算法。
3.
A line search technique for nonlinear equations which is a modification of the so called "derivative free line search"given by Griewank (1986) is proposed.
改进了Ｇｒｉｅｗａｎｋ（１９８６）提出的关于求解非线性方程组的一种线性搜索方式。
6) linear search
线性搜索
1.
A Fast Motion Estimation Algorithm Based on Linear Search;
一种基于线性搜索的快速运动估计算法
2.
A penalty-free-type two-step linear search algorithm
一个无惩罚型两步线性搜索算法
3.
The local search ability of linear search can speed up the rate of convergence.
混沌优化利用混沌变量的特定内在随机性和遍历性来跳出局部最优点 ,而线性搜索可以提高局部空间的搜索速度和精度。
补充资料：折线
用线段依次连接不在一直线上的若干个点所组成的图形。各线段称为折线的边；各点称为折线的顶点，其中第一点称为起点，最后一点称为终点。起点和终点重合的折线称为封闭折线或多边形。不相邻的两边都不相交的折线称为简单折线。如果对于简单折线的任一边所在的直线，折线其他各边都在其同侧，则称此为凸折线；否则称为凹折线。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条