您要查找的是不是：
- Algorithms based on trust regions have been shown to be robust for unconstrained optimization problems. 摘要信赖域方法是解无约束优化问题的有效的和可靠的方法。
- In this paper,a class of new descent algorithm is proposed to solve unconstrained optimization problems. 研究给出了一类新的求解无约束优化问题的下降算法。
- The paper proposes a nonmonotonic BFGS-trust-region algorithm for unconstrained optimization. 摘要给出了一个解无约束最优化问题的非单调的新的BFGS校正的信赖域算法。
- Supermemory gradient method is one of the efficient methods for solving unconstrained optimization problems. 摘要超记忆梯度算法是无约束优化的有效算法之一。
- It is well known that the Newton-PCG like algorithms are very efficient for solving the unconstrained optimization problems. 使用条件预优共轭梯度技术的不精确牛顿算法已在优化计算中被广泛采用，并被认为是十分有效的方法。
- A class of nonmonotone algorithms for unconstrained optimization is studied. Under mild conditions,the global convergence is proved. 本文研究了无约束优化问题的一类非单调算法.;在较弱的条件下;证明了算法的全局收敛性
- Preliminary numerical results show that this method is very efficient and is suitable for solving Large-scale unconstrained optimization. 数值试验结果表明，该方法具有良好的计算效能，特别适合于求解大规模无约束优化问题。
- A descent algorithm for solving unconstrained optimization is discussed. Global convergence result is established with inexact line search. 摘要研究了求解无约束优化问题的一种共轭下降算法，并在非精确线搜索条件下证明了该算法的全局收敛性。
- Use the gray processing, image binarization, the eight-neighbor connectivity method, least squares, unconstrained optimization knowledge. 用到了灰度处理、图像二值化、八邻域连通法、最小二乘法、无约束最优化等知识。
- The algorithms exploiting alternatively Newton iteration and inexact Newton iterationto solve the unconstrained optimization problems are considered. 研究交替使用牛顿迭代与近似牛顿迭代求解无约束最优化问题的混合算法。
- In this thesis, we engage in studying the algorithms which combine the negative curvature direction and nonmonotone technique to solve the unconstrained optimization. 本文研究的就是同时使用负曲率方向和非单调技术解无约束优化问题的算法。
- Punishment function is used to transfer the constrained optimization to unconstrained optimization and the Nelder and Mend Method is used to solve this optimization problem. 采用罚函数将约束优化转化为无约束优化，并用单纯形方法求解。
- A no-line-search parallel nonlinear conjugate gradient method (NLS-PNCG) for unconstrained optimization is proposed.In this method the step length is evaluated by a fixed formula. 摘要给出了一类无需线搜索的无约束最优化并行算法-并行非线性共轭梯度法(NLS-PNCG)，用一个固定的公式来计算搜索步长，较常用的共轭梯度法计算量小。
- In this paper, we have constructed a new algorithm for unconstrained optimizations. 摘要构造了一个求解无约束优化问题的新算法。
- Based on the work of Powell, Dennis and Zhao Yingliang, the first part of this thesis puts forward the hybrid method to solve the subproblem. It is applied to deal with the ordinary unconstrained optimization problem. 基于Powell的单折线法、Dennis的双折线法和赵英良的切线单折线法，本文第一部分提出了解信赖域子问题的混合折线法，并用于解一般的无约束优化问题。
- Then, by choosing the control weighted matrix R reasonably, the constrained optimization problem as formation keeping with electric rocket propellant can be transformed into the unconstrained optimization to be solved. 然后通过合理的选择控制加权矩阵R,用无约束的线性二次型优化方法解决了电推力火箭有控制约束的优化问题。
- In chapter 2, based on the unconstrained optimization reformulation of GNCP given in chapter 1, we design a Newton-type method for solving it without using the second-order derivatives of F and G. 第二部分，基于我们给出的广义互补问题的无约束优化转化形式，我们建立了一种牛顿型求解算法，该算法不需要广义互补问题涉及的映射函数的二阶梯度信息。
- When using parallel coarse divided mesh method to calculate geometric reliability, the exterior penalty function is introduced to transform constrained optimization into unconstrained optimization. 通过并行粗格子法求解可靠度时，将约束优化转化为无约束优化应用了外惩罚函数法。
- A modification of the HS formula is introduced for unconstrained optimization problem.In the proposed algorithm, the new formula possesses the sufficient descent property without any line searches. 给出修正的HS公式，并且将其应用到无约束优化中，得到一类新的共轭梯度（型）算法，新的公式不需要任何线搜索可以保持充分下降性。
