| 1. | The aim of this paper is to construct a three - term conjugate gradient method to solve the trust region subproblem
在本文中，我们提出了解信赖域子问题的三项预处理共轭梯度法，并将这个方法嵌入解大型最优化问题的信赖域算法中。 |
| 2. | Information technology - international standardized profile ra - relaying the connectionless - mode network service - fddi lan subnetwork - dependent , media - dependent requirements
信息技术.国际标准化轮廓ra .无连接式网络服务的转接. fddi与局域子网络相关，与媒体相关的要求 |
| 3. | 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
当由信赖域子问题求得的搜索方向不被接受时，利用线搜技术得到接受步长，定义新的有足够下降量的迭代点。 |
| 4. | Meanwhile , we point out the privilege and defective of cim . the fourth chapter is the main body of this paper . we explore how to apply the cim to solve unconstrained optimization problems effectively
第四章是本文的主要部分，探讨了锥模型信赖域子问题的求解及不完全锥函数插值模型算法的数值实现。 |
| 5. | Information technology . international standardized profil ra . relaying the connectionless - mode network service . part 3 : csma cd lan subnetwork - dependent , media - dependent requirements . european standard en isp 10613 - 3
信息技术.国际标准化轮廓ra .无连接试网络服务中继.第3部分:与csma cd型局域子网相关并且与介质相关的要求 |
| 6. | This paper presents a conjugate gradient method using restart strategy for solving trust region subproblems . and the convergence is proved . the numerical results show that this strategy is very effective
摘要给出了用共轭梯度法解信赖域子问题的重新开始策略，并证明了方法的收敛性，数值结果表明该策略可以大大提高算法的收敛速度。 |
| 7. | Lans mac information technology - international standardized profile tannnn - connection - mode transport service over connectionless - mode network service - mac sublayer and physical layer dependent requirements for a token ring lan subnetwork
信息技术.国际标准轮廓tannnn .无连接方式服务上的连接方式的传送服务.第13部分:采用环形局域子网络 |
| 8. | At first , on the basis of the sufficient and necessary optimality conditions , we give a certain algorithm to compute the trust region subproblem ; then , we draw out a different scheme for parameter vector in cim
在分析子问题最优性条件的基础上，我们给出了锥函数模型信赖域子问题的求解算法；并从数据拟合的角度提出了对锥模型中参数向量的另外一种选择方案。 |
| 9. | We use a scaling matrix which make the algorithm generate sequences of point in trust region and the interior of the feasible set . because of the boundedness of the trust region , trust region algorithm can use non - convex approximate models
构造合理的仿射变换矩阵，在投影空间构造信赖域子问题，产生迭代方向，使迭代点既保持在信赖域内，又是严格可行域的内点。 |
| 10. | It is posssible that the trust region subproblem needs to be resolved many times before obtaining an acceptable step for the traditional trust region method , and hence the total computation for completing one iteration might be expensive
对于传统的信赖域方法，要获得可接受的迭代步可能要通过重复计算多次信赖域子问题才能获得，因此每完成一次迭代的整个计算会比较大。 |
