unconstrained optimization method 中文意思是什麼

unconstrained optimization method 解釋
無約束優化方法
  • unconstrained : adj. 1. 不受強制的，自由的。2. 非強迫的，自發的，自動的。3. （態度）不勉強的，從容的。adv. -ly
  • optimization : n. 最佳化，最優化。
  • method : n 1 方法，方式；順序。2 （思想、言談上的）條理，規律，秩序。3 【生物學】分類法。4 〈M 〉【戲劇】...
  1. A parallel coordinate descent method for unconstrained optimization

    無約束優化的并行坐標下降法
  2. A new conjugate gradient method for solving unconstrained optimization

    求解無約束最優化問題的一類新共軛下降演算法
  3. Global convergence of the non - quasi - newton method for unconstrained optimization problems problems

    基於非擬牛頓方法無約束最優化問題的全局收斂性
  4. At the second part, nonmonotonic trust region method for unconstrained optimization is studied

    第二部分主要研究無約束最優化問題非單調信賴域法。
  5. For the quasi - newton type trust region method based on the conic model solving unconstrained optimization, horizon vector of the conic medel is proposed, the unique optimal parameter is determined and the numerical results are given in this paper

    摘要對于求解無約束優化問題的錐模型擬牛頓型信賴域方法，本文主要討論了水平向量的選取及最優參數的確定，並給出了數值試驗結果。
  6. The generalized quasi - newton method for nonconvex unconstrained optimization problems

    一般無約束優化問題的廣義擬牛頓法
  7. Nocedal and yuan suggested a combination of the trust region and line search method for unconstrained optimization. this mixed technique is called backtraking

    Nocedal和yuan提出了信賴域與線搜索兩種技術相結合的方法，稱為回代法（ backtracking ） 。
  8. Lc1 unconstrained optimization problem was discussed in the second chapter, giving a new trust region method and proving its global convergence and superlinear convergence under some mild conditions

    給出了一個新的信賴域演算法，並在一定的條件下證明了演算法的全局收斂性和局部超線性收斂性。
  9. In this paper we reformulate gcp a sasystem of nonlinear equations, and the gcp is reformulated as unconstrained optimization problem, as for the optimization problem, the damped gauss - newton method algorithm of two kinds of steps is employed for obtaining its solution, and the global convergence analysis are given in this thesis

    摘要本文將廣義互補問題轉化為一個非線性方程組問題，然後建立了gcp問題的無約束優化問題的轉化形式，對該優化問題，用兩種步長下的阻尼高斯牛頓演算法來求解，並給出了兩種情況下演算法的全局收斂性。
  10. This paper mainly concerns the conic interpolation model method for unconstrained optimization and its implementation, the structure of which is organized as follows : firstly, we survey the history of the direct search methods concisely, and summarize the methods that are currently considered to be effective for unconstrained optimization

    首先介紹了直接搜索方法的發展概況，歸納總結了目前比較有效的各種演算法。其次論文對于數值試驗結果較好的二次模型插值演算法和發展概況做了概要性的介紹。
  11. A level value descent method for unconstrained global optimization problems

    一種無約束全局優化的水平值下降演算法
  12. Zhu has studied unconstrained optimal problem by combining optimal path and modified path with nonmonotonic trust region methods in [ 9 ], and the use of l2 norm by trust region method in [ 1 ] in seeking the solution of unconstrained optimization has formed simple approximate trust region path, which enlightens us to solve nonlinear programming problem by curvilinear path

    朱德通在文[ 9 ]中將最優路徑和修正梯度路徑與非單調信賴域方法相結合討論無約束優化問題，且文[ 3 ]中用信賴域方法解無約束優化問題取l _ 2范數形成了形式簡單的近似信賴域路徑，此類思想啟發作者用弧線路徑來解決約束優化問題。
  13. Newton - pcg algorithm is very efficient for solving the unconstrained optimization problems. we considered an integer one - dimensional optimization problem appeared in newton - pcg method. the efficiency of newton - pcg algorithm is depended on the optimal value of this problem

    Newton - pcg演算法是解決無約束問題的有效方法，在該演算法中需要求解一個一維整數最優化問題，並且演算法的效率也依賴於它的最優值。
  14. Firstly, we simply introduce the scope, value and developement of the sparse quasi - newton method for unconstrained optimization problems

    第一章為緒論簡要介紹稀疏擬牛頓法的提出，研究情況及研究價值。
分享友人
分享到 Line

分享到臉書