約束優化 的英文怎麼說

中文拼音 [yāoshùyōuhuà]
約束優化 英文
co trained optimization
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  1. A nonmonotonic criterion is used to speed up the convergence progress in some ill - conditioned cases

    既約hesse演算法是目前較流行的解決非線性等式約束優化問題的有效方法之一。
  2. In this paper, we present a new algorithm for lcp - ssle algorithm

    本學位論文提出一個求解線性互補約束優化問題的新演算法? ? ssle演算法
  3. 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

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

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

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

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

    無約束優化問題線搜索方法的收斂性
  8. By taking these spatial points as initial guess, all exact real solutions withi n a certain range of variables are found using unrestraint optimization

    以這些空間點為初始值，利用無約束優化，得到在一定值范圍內的原方程組的全部精確實數解。
  9. The first part comprises industrial pta oxidation process modeling, residual fluid catalytic cracking process modeling, complex distillation modeling and analysis, the application of pta oxidation process soft - sensor technology. in the second one, the infeasibility degree based genetic algorithm is proposed to handle constrained optimization problem in engineering cases and the neighborhood and archive based genetic algorithm and its variant are proposed to treat the multi - objective optimization problem. with that, the pta oxidation process is regarded as a benchmark for the application of the proposed multi - objective optimization genetic algorithm

    論文內容分為兩部分，第一部分對包括三個典型的工業過程， pta氧化反應器、渣油催化裂化反應系統和復合式精餾塔進行分析、建模以及pta氧化過程的軟測量工程實施；第二部分分別提出了基於進化演算法解決工業過程中普遍存在的約束優化問題和多目標優化問題的過程優化演算法? ?基於不可行度選擇遺傳演算法和基於鄰域和存檔操作遺傳演算法，並利用該演算法對工業pta氧化過程操作進行多目標優化研究。
  10. Thus, inversion reliability and accuracy of multiparametric identification can be enhanced. then, based on the direct back analysis program dbapm of japan edition in construction forecast, the constrained optimization back analysis program cobap is developed. and the more reliable and accurate inversion forecast can be obtained when cobap is used in information construction and design in geotechnical engineering

    基於上述研究，在日本版的施工預報直接反分析程序dbapm基礎上，擴充編製成了約束優化反分析程序cobap ，通過dbapm程序和cobap程序的數值反演比較及工程應用，說明cobap程序在信息化施工與設計領域具有更為合理可靠的反演預報功能與應用價值。
  11. A class of efficient new descent methods

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

    一類無約束優化問題的的共軛梯度法
  13. In this thesis we propose a scaling trust region interior point algorithm for linear constrained optimization subject to bounds on variable

    本文將提出一種仿射變換的信賴內點演算法解決變量有界的線性等式約束優化問題。
  14. Artificial fish - swarm algorithm for solving constrained optimization problems

    求解約束優化問題的人工魚群演算法
  15. The heuristic analysis, some concepts and theorems of constrained optimization are employed, e. g., linear feasible direction ( lfd ), and then the proof is first provided for the uniqueness, i. e., maximum nongaussianity is the sufficient and necessary condition to independent source recovery. moreover, based on the conclusion of the uniqueness of maximum nongaussianity, the paper also proposes an alternative but straightforward approach to the proof for the well known “ one - bit - matching ” conjecture presented in multi - unit approaches

    和基於啟發性分析等傳統方法和結論比較，文中引入了線性化可行方向（ linearfeasibledirection ， lfd ）等約束優化概念和理論，首次給出了基於峭度的最大非高斯估計的唯一性證明，指出最大非高斯估計是獨立源提取的充分和必要條件。
  16. The kinematic performance of the macpherson suspension on a real vehicle is studied, and the changes of the front wheel alignment and the motion of the front wheel in the longitudinal and the transversal directions are figured. based on the requirements of general layout, a constrained optimization design model is set up with the steering cross rod ball joint position as the optimization variables ( design parameters ), and the sum of steering cross rod length interference while the left front wheel turning and bouncing as the objective function. and the optimization results are worked out by programming on computer

    針對一種實際車型上的麥弗遜式懸架，計算分析了轉向輪跳動時前輪定位角和車輪橫向、縱向滑移量的變化情況，並根據實際車型上麥弗遜式懸架的空間布置要求，建立了以轉向橫拉桿斷開點空間位置坐標為優化變量，轉向橫拉桿斷開點空間布置坐標可變化范圍為約束條件，車輪轉向和跳動時轉向橫拉桿長度干涉量為目標函數的約束優化設計模型。
  17. Secondly, the penalty coefficient may converge to infinity in many situations when the iterative point is closely near the bound of feasible set, while the parameters are bounded if the solution set of constrained optimization is nonempty, which is available for numerical computation

    另外在很多情況下，罰函數法中的罰因子當迭代點接近可行域邊界時趨于無窮大，而參數控制演算法中，只要約束優化問題有最優解，則參數是有界的，這對數值計算是有利的。
  18. 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 -超線性速度的理論證明；其次，用經典的無約束優化五大考核函數就本共線調比演算法進行了數值試驗和數值分析；最後，就局部二次逼近思想，進行共線調比演算法思想進行更廣泛的討論，給出了幾個新共線調比演算法。
  19. To circumvent the non - differentiable difficulty caused by the positive homogeneously function that is involved in an equivalent unconstrained formulation for general inequality constrained optimization problems, we turn to the classical lagrangian function and redefine m ( x ) by a conic optimization problem with the lagrangian as the objective function

    為了克服不可微正齊次函數（ ? | r _ - ~ m ）給約束優化問題的等價無約束形式求解帶來的困難，我們將其目標函數m （ x ）重新用一個以經典拉格朗日函數為目標的錐優化問題來表示。
  20. 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

    摘要對于求解無約束優化問題的錐模型擬牛頓型信賴域方法，本文主要討論了水平向量的選取及最優參數的確定，並給出了數值試驗結果。
分享友人
分享到 Line

分享到臉書