搜索方向

• By adopting texture statistics for ray - space slice , initial search direction was established , and then multi - layer rectilinear direction search method was realized in inter - slice prediction
  在片间预测中，通过对光线空间片的纹理统计，确立初始的搜索方向，实现分层的直线方向搜索方法。
• Of course , the prerequisite for being able to making this shift is that although the trial step is unacceptable as next iterative point , it should provide a direction of sufficient descent
  当由信赖域子问题求得的搜索方向不被接受时，利用线搜技术得到接受步长，定义新的有足够下降量的迭代点。
• 2 . researching on the method for the application of theory of technology evolution patterns of evolution and paths of evolution are the searching paths for solving the problem
  应用技术进化理论的方法研究技术进化模式及进化路线本身就是问题求解的搜索方向，按照归纳的进化模式和进化路线来搜索可行解。
• In order to avoid blind searching ergodicity in the overall situation before reducing the searching space of the variable optimized in chaos optimization algorithm , an optimization algorithm based on the chaos searching direction
  摘要为了克服混沌优化方法在缩小优化变量的搜索空间前所进行的全局性、遍历性的盲目搜索，提出了一种基于混沌搜索方向的全局最优方法。
• In general trust region method , a trial point is accepted as a new iterate and the procedure is repeated if the true reduction achieved by the objective function at this point is comparable with the reduction predicted by the quadratic model
  考虑到在一般的信赖域方法中，当目标函数沿该搜索方向的实际下降量和预计下降量拟合得比较好时，则由该搜索方向得到新的迭代点并调整信赖域半径。
• The main difficulty for the global convergence of the structured bfgs method lies in that the matrices generated by the method may not be positive definite . as a consequent , the direction generated by the method may not be a descent direction of the objective function
  建立具有全局收敛性的结构化拟newton法的一个主要困难是在于该算法产生的矩阵不一定是正定的，从而产生的搜索方向不一定是目标函数的下降方向。
• Though simulating the state of packing , adopting the experience of manual packing and heuristics knowledge to control the searching way and limit the search space , it changes the packing problem into the problem of searching best path in the state space
  文中对多边形的合成技术进行了研究，通过模拟布局状态，吸取人工布局的经验，采用启发式知识控制搜索方向，限制搜索空间，把布局问题转化为在状态空间下寻找最优路径的问题。
• The hybrid algorithm raises the convergence rate of the conjugate gradient method and solves the problem for which the convergence rate of the steepest descent method get slower when the isopleth of goal function is oblong
  这种混合优化算法结合了共扼梯度法和最速下降法产生搜索方向，既提高了共扼梯度算法的收敛速度，又解决了目标函数的等值线是扁长椭球时，最速下降法下降缓慢的问题，具有收敛速度快、收敛范围大、适应面广等特点。
• Trust region methods has drawn our attention increasingly as one approximating method guarantees general convergence . its basic step is as follows : first , we set trust - region radius , and then we get a trial step produced by constraint quadratical model
  信赖域方法是近年来日益受到关注的一种新的保证算法整体收敛性的逼近方法，信赖域方法的基本步骤是首先指定一个信赖域半径，然后用带约束的二次模型来确定搜索方向与步长大小。