約束最優化 的英文怎麼說

中文拼音 [yāoshùzuìyōuhuà]
約束最優化 英文
constrained optimization
  • 約 : 約動詞[口語] （用秤稱） weigh
  • 束 : Ⅰ動詞1 （捆; 系） bind; tie 2 （控制; 約束）control; restrain Ⅱ量詞（用於捆在一起的東西） bundle;...
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 約束 : keep within bounds; restrain; bind; bound; boundage;tie; restraint; restriction; engagement; repr...
  1. It consider the resolution of isotonic regression by view of constraint optimization, and it also presents the relation between isotonic regression and mle in detail. 2

    從約束最優化的觀點了證明了保序回歸解的唯一存在性，並詳細地給出了保序回歸與最大似然估計之間的關系。
  2. 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系統轉化為等價的非光滑方程組。
  3. Problems of unconstrained optimization and variational inequality

    變分不等式問題與無約束最優化問題
  4. 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

    其次，結合要處理的具體問題，介紹數值優化及幾種常用的無約束最優化計算方法，以最優梯度法為基礎，討論其演算法的優缺點，通過引進阻尼系數，改進了演算法的收斂速度，從而提高迭代精度。
  5. Solution to constrained optimization problems in fuzzy expert system

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

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

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

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

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

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

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

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

    本文研究求解約束最優化問題的序列二次規劃演算法（ sqp演算法） 。
  14. We present and analyze a modified penalty functions ( mpf ) method for solving constrained optimization problems with inequality constraints. this method combines the modified penalty and the lagrangian methods

    本文提出並分析一種解決不等式約束最優化問題的修改的罰函數法，這一方法綜合利用修改的罰函數和拉格朗日法。
  15. Three - term memory gradient rosen and solodov projection method for nonlinear programming with linear or nonlinear inequality constraints

    解帶線性或非線性約束最優化問題的混合三項記憶梯度投影演算法
  16. 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是二次連續可微的，可以有許多方法尋找它的極小點。
  17. Some important algorithms for nonlinear optimization problems are studied in this dissertation. the aim of this dissertation is to give some theoretical analysis. chapter 1 is the introduction of this dissertation, which introduces the variational inequality problem and the complementarity problem, the context of this dissertation and the main results obtained in this dissertation

    本文主要是對非線性最優化問題中的若干重要演算法的理論分析作了探討，包括約束最優化問題中的梯度投影方法以及求解變分不等式和互補問題的幾類演算法，主要是集中在這幾種演算法的收斂性分析上。
  18. The purpose of the sqp - filter method is to overcome the numerical difficulty caused by the use of large penalty factor in the sqp method

    其主要目的是為了克服求解約束最優化問題的序列二次規劃（ sqp ）演算法中罰參數太大而造成的數值計算上的困難。
  19. In the image reconstruction based on optimization without constraint, the variable metric method, the steepest descent method, and conjugate gradient method were applied to image reconstruction to improve iterative efficiency and reconstructed quality, and their virtue and shortcoming were analyzed

    摘要在無約束最優化為基礎的圖像重建問題中，為了提高迭代效率以及重建圖像質量，首次提出將變度量法應用到圖像重建中。
  20. The objective function of the qp problem is a quadratic function which is an approximation of the lagrangian function of the constrained problem and the constraints of the qp problem are linear approximation of the constraints of the constrained problem

    這些二次規劃子問題的目標函數是原約束最優化問題的lagrange函數的二次某種近似，其約束條件是原約束最優化問題的線性逼近。
分享友人
分享到 Line

分享到臉書