最優化問題 的英文怎麼說

中文拼音 [zuìyōuhuàwèntí]
最優化問題 英文
optimalization problem
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 問 : Ⅰ動詞1 （請人解答） ask; inquire 2 （詢問; 慰問） question; ask about [after]; inquire about [aft...
  • 題 : Ⅰ名詞1. （題目） subject; title; topic; problem 2. （姓氏） a surname Ⅱ動詞（寫上） inscribe; write
  • 問題 : 1 （需回答的題目） question; problem 2 （需研究解決的矛盾等） problem; matter 3 （事故或意外） tr...
  1. By using network flow theory, the optimization problem of power conservation is transformed into the optimal bipartition problem of a flow network which can be partitioned by the max - flow mm - cut algorithm

    利用網路流理論，將節約電量的最優化問題轉化為一個流網路的最優分割問題，而後者可採用最大流最小切割演算法實現最優切分。
  2. A linearization method for minimizing a particular class of quasi - differentiable functions

    一類特殊擬可微函數最優化問題的線性化方法
  3. Duality in optimization involving a type of invexity

    一類不變凸最優化問題的對偶理論
  4. First, we reformulate the kkt systems of the constrained optimization problem and the symmetric variational inequality prpoblem into equivalent nonsrnooth equations by using the so called ncp functions

    本文研究求解約束最優化問題和對稱變分不等式kkt系統的bfgs演算法。首先利用ncp函數將問題的kkt系統轉化為等價的非光滑方程組。
  5. In economic optimization problems the variables involved are almost always subject to certain constrains.

    在經濟學最優化問題中所含的變量差不多總是帶有某種約束條件。
  6. The cone - subdifferential of efficient solutions set for vector optimizations problem with perturbed order

    錐擾動向量最優化問題有效解的錐次微分
  7. Problems of unconstrained optimization and variational inequality

    變分不等式問題與無約束最優化問題
  8. Studies optimization problems which a urban coal field location layout and the coal allocates and dispatches

    摘要研究一個城市煤場布局與煤炭配送的最優化問題。
  9. Genetic algorithm, as a computational model simulating the biological evolution process of the genetic selection theory of dar - win, is a whole new global optimization algorithm and is widely used in many fields with its remarkable characteristic of simplicity, commonability, stability, suitability for parallel processing, high - efficiency, and practibility. on the other hand, there are many op - timization problems in the field of digital image processing, such as image compression, pattern - recognition, image rectification, image segmentation, 3d image recovery, image inquiry, and or so. in fact all these problems can be generalized as the problem of searching for a global optimal solution in a large solution space, which is the classic application field of genetic algorithm

    遺傳演算法是模擬達爾文的遺傳選擇和自然淘汰的生物進化過程的計算模型，是一種新的全局優化搜索演算法，具有簡單通用、穩定性強、適于并行處理以及高效、實用等顯著特點，在很多領域得到了廣泛應用，另一方面，在圖像處理領域有很多優化問題如圖像壓縮，模式識別，圖像校準，圖像分割，三維重建，圖像檢索等等，實際上都等同於一個大范圍搜索尋優問題，而最優化問題是遺傳演算法經典應用領域，因此遺傳演算法完全勝任在圖像處理中優化方面的計算。
  10. Crosstalk profile ? using the measured near - end loop noise psd, an estimate can be made of the type and number of crosstalkers present. again, this is a multi - variate optimization problem

    串擾概圖使用已測的近端環路噪聲psd ，就可以估計當前串擾的類型和數量。這也是一個多變量的最優化問題。
  11. Solution to constrained optimization problems in fuzzy expert system

    模糊專家系統中約束最優化問題求解
  12. A new conjugate gradient method for solving unconstrained optimization

    求解無約束最優化問題的一類新共軛下降演算法
  13. The multi - object simulated annealing algorithm for the nonlinear constraint optimization problem

    非線性約束最優化問題的多目標模擬退火演算法
  14. Global convergence of the non - quasi - newton method for unconstrained optimization problems problems

    基於非擬牛頓方法無約束最優化問題的全局收斂性
  15. In this paper, we adopt the idea of sqp - filter to develop a newton - filter method

    本文將過濾器演算法的思想應用於求解無約束最優化問題的newton法。
  16. At the second part, nonmonotonic trust region method for unconstrained optimization is studied

    第二部分主要研究無約束最優化問題非單調信賴域法。
  17. Research of solving bound constrained optimization of nonlinear programming with orthogonal design

    用正交設計方法求解非線性規劃的區間約束最優化問題
  18. The structured bfgs method is a quasi - newton method for solving the nonlinear least squares problem

    解非線性最小二乘問題的結構化擬newton方法是求解無約束最優化問題的標準擬newton方法的推廣。
  19. In this paper, we are concerned with the sequence quadratic programming ( sqp ) methods for solving constrained optimization problems

    本文研究求解約束最優化問題的序列二次規劃演算法（ sqp演算法） 。
  20. This paper is mainly considered : 1 ) how joint coded modulation transmitter is designed based on the iterative decoder. 2 ) the combination of ldpc code with bit - interleaved coded modulaton. 3 ) the optimization of two dimensional signal constellations in joint coded modulation with iterative decoder

    本文研究工作的重點在於: 1 ）迭代譯碼對聯合編碼調制方案設計的影響; 2 ）新的糾錯編碼和比特交織編碼調制的有機結合; 3 ）高階星座的最優化問題。
分享友人
分享到 Line

分享到臉書