無約束優化 的英文怎麼說

中文拼音 [wúyāoshùyōuhuà]
無約束優化 英文
unconstrained optimization
  • 無 : 無Ⅰ動詞（沒有） not have; there is not; be without Ⅱ名詞1 （沒有） nothing; nil 2 （姓氏） a surn...
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  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. By taking these spatial points as initial guess, all exact real solutions withi n a certain range of variables are found using unrestraint optimization

    以這些空間點為初始值，利用無約束優化，得到在一定值范圍內的原方程組的全部精確實數解。
  7. A class of efficient new descent methods

    求解無約束優化問題的一類新的下降演算法
  8. A class of conjugate gradient methods for unconstrained optimization

    一類無約束優化問題的的共軛梯度法
  9. Using the conic function model local approximation, w. cdavidon ( 1980 ) proposed a class of iterative algorithms with modified matrix combining function value, furthermore under the theory d. c. sorensen has used local quadratic approximation method, then applying collinear scaling idea improving on the above algorithm and generalizing it, getting a class of collinear scaling algorithm, unifying former quasi - newton. in the paper, using local quadratic approximation method, the first, constructing the new collinear scaling gene, getting a class of the new collinear scaling algorithm with briefness and numerical stability, ., we discusses some properties of the algorithm and its local linear convergence, q - superlinear convergence and the whole convergence ; secondly we have made numerical experimentation and numerical analysis ; the last, we have done much discussion for collinear scaling idea and given the several new collinear scaling algorithm

    本文的工作就是基於局部二次逼近原理，首先通過構造新的共線調比因子，得到了一類新的更簡潔，數值穩定性更好的共線調比演算法，進而我們給出了本共線調比演算法的局部收斂性，全局收斂性以及演算法q -超線性速度的理論證明；其次，用經典的無約束優化五大考核函數就本共線調比演算法進行了數值試驗和數值分析；最後，就局部二次逼近思想，進行共線調比演算法思想進行更廣泛的討論，給出了幾個新共線調比演算法。
  10. 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

    摘要對于求解無約束優化問題的錐模型擬牛頓型信賴域方法，本文主要討論了水平向量的選取及最優參數的確定，並給出了數值試驗結果。
  11. Global convergence of a class of unconstrained optimal methods included conjugate descent method

    包含共軛下降法的一類無約束優化方法的全局收斂性
  12. The paper introduces the method of optimal design, which includes the non - constrained optimal design and constrained optimal design, then brings this method into the modeling of nurbs surfaces to resolve practical problems. the fitting of nurbs curves and surfaces are discussed in detail

    其次，本文介紹了最優化設計方法，包括無約束優化方法和約束優化設計方法，並將最優化方法全面引入到nurbs曲線、曲面造型中去，解決設計中的實際問題。
  13. The generalized quasi - newton method for nonconvex unconstrained optimization problems

    一般無約束優化問題的廣義擬牛頓法
  14. A class of nonmonotone conjugate gradient methods for unconstrained optimization

    一類無約束優化問題的非單調共軛梯度法
  15. An improvement of simulated annealing algorithm solving unconstrained optimization problem

    無約束優化問題模擬退火演算法的改進
  16. 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問題的無約束優化問題的轉化形式，對該優化問題，用兩種步長下的阻尼高斯牛頓演算法來求解，並給出了兩種情況下演算法的全局收斂性。
  17. The algorithm is based on a reformulation of the complementarity problem as an unconstrained optimization. it is proved that the algorithm is globally convergent

    在將互補問題轉化為一個無約束優化問題的基礎上，給出了一種求解互補問題的混合方法，證明了該演算法的全局收斂性。
  18. The penalty function method first change the optimization problem with constraints to no constraint problem then solve the no constrains optimization problems using hooke - jeeves direct search method. the above method only use the dynamic analysis result together with penalty function method to solve the multibody desigen optimization problems, and separate the process of dynamic analysis and design optimization, so it is more common

    由於該方法是將約束優化問題轉化為無約束優化問題，針對無約束優化問題，本文採用通用的hooke - jeeves直接探索優化方法，有效的實現了多體系統動力學分析與優化設計的分離，從而具有通用性。
  19. 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范數形成了形式簡單的近似信賴域路徑，此類思想啟發作者用弧線路徑來解決約束優化問題。
  20. In chapter 1, we first introduce the development of optimization and some extensive optimality conditions which to decide the optimum solution. we review several extensive derivative descent methods of unconstrained programming and feasible descent methods of constrained programming

    在第一章我們首先簡要的介紹了最優化問題的提出以及判斷最優解常用的最優性條件，回顧了無約束優化問題常用的幾類導數下降類演算法和約束優化問題的可行方向法。
分享友人
分享到 Line

分享到臉書