unconstrained optimization 中文意思是什麼

unconstrained optimization 解釋
非線性最優化
  • unconstrained : adj. 1. 不受強制的，自由的。2. 非強迫的，自發的，自動的。3. （態度）不勉強的，從容的。adv. -ly
  • optimization : n. 最佳化，最優化。
  1. The parameter control methods are very similar to penalty function methods, both of them are to solve constrained optimization problems by solving a series of sub - unconstrained optimization problems. but parameter control methods are different from penalty function methods. firstly, the penalty coefficient of penalty function methods are preassigned, while the parameters of parameter control methodsare generated automatically according to some rule prescribed

    參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。
  2. A derivative - free algorithm for unconstrained optimization

    求解無約束優化問題的免梯度演算法
  3. A descent algorithm for solving unconstrained optimization

    求解無約束優化問題的一種下降演算法
  4. A parallel coordinate descent method for unconstrained optimization

    無約束優化的并行坐標下降法
  5. Convergence of line search methods for unconstrained optimization

    無約束優化問題線搜索方法的收斂性
  6. Problems of unconstrained optimization and variational inequality

    變分不等式問題與無約束最優化問題
  7. The topics covered in this course include : unconstrained optimization methods, constrained optimization methods, convex analysis, lagrangian relaxation, nondifferentiable optimization, and applications in integer programming

    這門課程的主題包括：無限制最適化方法，限制最適化方法，凸分析，拉格朗日鬆弛法，不可微分函數最適化，以及在整數規劃上的應用。
  8. A class of conjugate gradient methods for unconstrained optimization

    一類無約束優化問題的的共軛梯度法
  9. A new conjugate gradient method for solving unconstrained optimization

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

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

    第二部分主要研究無約束最優化問題非單調信賴域法。
  12. 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

    第四章是本文的主要部分，探討了錐模型信賴域子問題的求解及不完全錐函數插值模型演算法的數值實現。
  13. An algorithm of solving nonlinear coupled equations is given which transforms the solving problem to unconstrained optimization problem and the coupled equations are solved by a genetic algorithm and newton iteration

    同時還給出了一種求解非線性方程組的演算法，即將非線性方程組的求解問題轉化為帶約束的優化問題，應用遺傳演算法和牛頓迭代法求解。
  14. In unconstrained optimization, we deal with the standard problem of finding the minimum of a function f : rn - r. if we assume that the function is twice continuously differentiable, many methods can be applied to find the minimum

    在無約束最優化中，考慮尋找f ： r ~ n r的極小點。假設f是二次連續可微的，可以有許多方法尋找它的極小點。
  15. 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

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

    一般無約束優化問題的廣義擬牛頓法
  17. 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 ） 。
  18. A class of nonmonotone conjugate gradient methods for unconstrained optimization

    一類無約束優化問題的非單調共軛梯度法
  19. 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

    給出了一個新的信賴域演算法，並在一定的條件下證明了演算法的全局收斂性和局部超線性收斂性。
  20. An improvement of simulated annealing algorithm solving unconstrained optimization problem

    無約束優化問題模擬退火演算法的改進
分享友人
分享到 Line

分享到臉書