無約束問題 的英文怎麼說

中文拼音 [wúyāoshùwèntí]
無約束問題 英文
unconstrained problem
  • 無 : 無Ⅰ動詞（沒有） not have; there is not; be without Ⅱ名詞1 （沒有） nothing; nil 2 （姓氏） a surn...
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 問 : Ⅰ動詞1 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  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. Convergence of line search methods for unconstrained optimization

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

    變分不等式問題與無約束最優化問題
  6. To solve the difficulties of digital integral that exist in global optimization of redundant manipulators, this paper discussed how to build up dynamic equation, the inner relation between constraints and unconstraint optimum control problems, then a digital method solving optimum control problems is deeply analyzed

    摘要為了解決冗餘度機器人全局法優化中數值求解的困難，本文討論了動力學方程的建立、無約束和有約束最優控制問題之間的內在聯系，重點分析了求解最優控制問題的數值方法。
  7. Optimal design with three variables is then done to the elbow - bar mechanism of the mp1040b moulding machine by utilizing the method of punishing function for constraint problems and variational scale for unconstraint problems. the optimal target function is the maxium of gradient in one work travel for the moulding plank of the elbow - bar mechanism. the result shows that the maximal gradient of moulding plank in one motion period declines by 25. 7 after optimization, and the angular acceleration of the bottom moulding plank decreases greatly

    動力學分析中，各構件的質量和轉動慣量是通過pro / engineer軟體，先建立各個構件幾何模型而求得；然後，利用解決約束問題的罰函數法和處理無約束問題的變尺度法對mp1040b型模切機肘桿機構進行三個設計變量的優化設計，優化目標函數為肘桿機構的下模切板在一個工作行程中達到的最大傾斜程度；通過優化設計，模切機肘桿機構的下模切板在一個工作行程中的最大傾斜程度降低了25 . 7 ，其角加速度明顯減小，提高了模切機動力學性能。
  8. On the construct design of a fixed - fixed undamped mass - spring system under the sum of mass of system restriction

    固定型無阻尼彈簧質點系統的質量約束問題
  9. First, the nonlinear ls problem without constraint is converted to that subjected to inequality constraints by putting constraints on the do as of the received signals and toas of the first arrived signal with geometrically based single - bounce ( gbsb ) statistical channel model and cost - 207 model. then, a penalty function is used in the estimation of ms position

    首先，用基於幾何結構的單次反射圓模型和cost - 207模型，對期望定位用戶的各條多徑信號的波達方向和最先到達多徑信號的時間進行約束，將傳統的解無約束的非線性最小二乘定位問題或近似線性最小二乘定位問題轉化為解不等式約束的非線性最小二乘定位問題；然後，用內點罰函數法估計移動臺的位置。
  10. Among hese method, one of the simplest is the deepest gradient descent algorithm, but it has one disadvantage that the solutions are oscillatory and slowly convergent. a friction term is ntroduced to avoid oscillatory solutions and raise convergence rate. the third major contribution of this dissertation is study on 3 - d diffuse object surface optical automatic measurement

    其次，結合要處理的具體問題，介紹數值優化及幾種常用的無約束最優化計算方法，以最優梯度法為基礎，討論其演算法的優缺點，通過引進阻尼系數，改進了演算法的收斂速度，從而提高迭代精度。
  11. In order to select the plan for a hydraulic project the conception of the entropy principle of the information theory has been introduced. this paper summarized as the problems lined up non - restraint and restraint project which are based on their characteristics weight coefficient and presented a method of real combined inherent information of projects chosen with decision - maker subjective sense

    為了解決水利水電投資方案的優選問題，本文引入信息論熵的概念，並以此為基礎，總結此類問題的特點，將其分為無約束方案排隊問題和有約束方案排隊問題，並相應提出一種結合優選方案的固有信息和決策主觀判斷力的使用權值的方法，然後建立模型。
  12. A class of efficient new descent methods

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

    一類無約束優化問題的的共軛梯度法
  14. Optimal periodic control with the lowest operational cost by limiting total substrate discharge mass was studied. through adding new state variable and using supplement functions, the problem with restriction conditions was converted into nonrestriction problem. in addition, the dynamic searching method of optimal step coefficient was developed to modify the conventional gradient method, consequently the calculation problem of the multivariable optimal periodic control was able to be resolved better. it was found that the operational costs of optimal control under various initial states are distinctly different. a new concept of optimal control under optimal initial state was presented. it is pointed out emphatically that to the treatment system without optimal control condition, the suboptimal control with extensive practical value can be realized according to the results of optima control

    著重研究了在限制有機物排放總量時，使其運行費用最低的最優周期控制問題.通過增加新的狀態變量和用補償函數法，將本課題的有約束條件問題化為無約束條件問題，並提出了最優步長參數的動態搜索法來修改傳統的梯度法，從而較完善地解決了多變量最優周期控制的計算問題.研究中還發現了不同初始條件下最優控制所需要的運行費用也大不相同，進而提出了最優初始狀態下最優周期控制的新概念，這對保證出水質量的同時進一步降低污水處理成本來說具有更重要的意義.本文還強調指出：對于尚不具備實現最優控制條件的處理系統，可根據最優控制的研究結果實現具有廣泛實用價值的準最優控制
  15. However, some of them are restrictive. for some of these methods, the convergence is not known in this paper, based on a modified bfgs update formula proposed by li and fukushima, we propose a modified bfgs method for solving equality constrained optimization

    本文在li - fukushima提出的求解無約束問題的修正bfgs公式的基礎上，對求解等式約束問題的sqp演算法，提出一個保證qp子問題的目標函數的hessian陣的正定性的修正方案。
  16. And then, the way to resolve the optimization problem is genetic algorithms. in substance, through throwing away the restriction of orthogonal condition in the optimization problems, there will be an optimization problem without restriction

    本質上來說，這樣做是把一個高維帶約束的優化問題轉換成為多個相對低維的不帶約束問題，而在理論上保持解的無損失。
  17. The proposed method can automatically locate components that cause the structural inconsistencies, and show the user detailed error messages. this information can be a great help in finding and localizing structural inconsistencies, and in some cases pinpoints them immediately

    基於modelica語言的陳述式非因果建模優點很多，可是也存在一個問題，那就是構建模型時常常會不經意地遺漏了方程或者多定義了方程，致使模擬模型在結構上奇異，即引起欠約束或過約束問題，從而使得模型無法求解。
  18. ( 4 ) penalty function method is used to import the constrains into the objective function

    （ 4 ）本文利用「懲罰函數法」將約束問題轉變為無約束問題。
  19. We make some improvements on it. as an efficient method to solve the optimization problems in svms, newton - pcg algorithmhas been introduced

    在演算法方面，本文在將支持向量機中的最優化問題轉化為無約束問題的前提下，研究了newton - pcg演算法。
  20. 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演算法是解決無約束問題的有效方法，在該演算法中需要求解一個一維整數最優化問題，並且演算法的效率也依賴於它的最優值。
分享友人
分享到 Line

分享到臉書