quadratic convergence 中文意思是什麼

quadratic convergence 解釋
二次收斂
  • quadratic : adj. 1. 【數學】二次的。2. 方形的。n. 1. 【數學】二次方程式；二次項。2. 〈pl. 作單數用〉【數學】二次方程式論。
  • convergence : n. 1. 聚合，會聚，輻輳，匯合。2. 集合點；【數、物】收斂；【生物學】趨同（現象）。
  1. In the second part, a decomposition method for solving semidefmite quadratic programming with box constraints is proposed. a regular splitting of the hessian matrix of the problem is used in the algorithm. the convergence of the algorithm is proved under certain assumptions, the numerical results are also given

    第二部分把解邊界約束正定二次規劃問題的正則分解演算法推廣到求解邊界約束半正定二次規劃問題，在理論證明的基礎上還進行數值檢驗，結果說明演算法是有效的。
  2. It exploits the structured of the hessian matrix of the objective function sufficiently. an attractive property of the structured bfgs method is its local superlinear / quadratic convergence property for the nonzero / zero residual problems. the local convergence of the structured bfgs method has been well established

    它們充分利用了目標函數的hesse矩陣的結構以提高演算法的效率，該演算法的顯著優點是對于零殘量問題具有二階收斂性而對于非零殘量問題具有超線性收斂性。
  3. We have deduced the iterative formula by the theory of the dynamic system, proved that the quadratic convergence holds under the weak conditions, and done the numerical experiments

    利用動力系統理論推導出該方法的迭代公式，證明其在某些弱條件下至少是二階收斂的，最後給出了數值結果。
  4. In this paper we improve the simplex algorithm for quadratic programs, from algorithm to convergence conditions, and get simpler procedure and converging rules

    摘要本文對二次規劃的單純形演算法，從演算法到收斂條件均加以改進，得到更簡易的程序和收斂準則。
  5. 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 -超線性速度的理論證明；其次，用經典的無約束優化五大考核函數就本共線調比演算法進行了數值試驗和數值分析；最後，就局部二次逼近思想，進行共線調比演算法思想進行更廣泛的討論，給出了幾個新共線調比演算法。
  6. Chapter 4 presents an error back propagation algorithm with quadratic momentum of the multilayer forward neural networks that will speed up the error convergence velocity

    本文提出一種帶二次動量項的多層前向網路誤差反傳演算法，提高了神經網路的誤差收斂速度。
  7. In particular, a simple iterative learning law based on infinite time optimal linear quadratic regulator is proposed and its convergence is analyzed in detail

    進而，得到了基於最優線性二次型無限時間輸出調節器的迭代學習控制律，並分析了其收斂和魯棒收斂的充分條件。
  8. Under appropriate conditions, we obtain the global and quadratic convergence of the proposed method

    在適當的條件下，我們證明了演算法的全局收斂性和二階收斂性。
  9. On the basis of this reformulation, it is proved that the system of nonsmooth equations is strongly semismooth so that the generalized newton method for solving this system possesses locally quadratic convergence

    在此基礎上，證明了非光滑方程是強半光滑的，因而解此方程的廣義牛頓法具有局部二次收斂性。
  10. A global convergence inner - point style algorithm for generic quadratic programming problem

    二次規劃問題的一個全局收斂的內點型演算法
  11. For nonlinear l1 problem based on the conditions for optimality of the nonlinear l1 problem in [ 1 ], we first discuss the descent direction of the objective function f ( x ) in theory, further more, we study the relation between the optimal solution of nonlinear l1 problem and the optimal solution of some kind of quadratic programming problem with box constrains. hence, we construct a descent algorithm for nonlinear l1 problem and prove the convergence of the algorithm

    在文[ 1 ]所給的最優性條件的基礎上，對非線性l _ 1問題從理論上研究了f （ x ）的下降方向、最優解與某種框式約束最小二乘問題的最優解之間的關系，進而構造了一個非線性l _ 1問題的下降演算法，並證明了該演算法的收斂性。
  12. The numerical results in chapter four appear to show that the convergence of the quadratic pe method and the quadratic pe ; method is better than the linear pe method and the linear pek method

    第四章的數值算例表明，二次pe方法和二次pe _ k方法的收斂性比一次pe方法和一次pe _ k方法的收斂性好。
  13. If the proper parameter is chosen, the linear pek method is superior to the linear pe method. ( 2 ) in order to improve the linear pe method and the linear pek method, the quadratic pe method and the quadratic pek method are put forward. then the solvability and the convergence of the two methods are discussed about the hermite positive definite matrix and m - matrix, and the interrelated conclusions are obtained

    （ 2 ）將一次pe方法和一次pe _ k方法改進為二次pe方法和二次pe _ k方法，討論了當系數矩陣a為hermite正定矩陣和m -矩陣時，二次pe方法和二次pe _ k方法的可解性和收斂性等問題，得到了相關的結論。
  14. ( 2 ) on the results of new quadratic pek method, the quadratic epek method is discussed. the convergence of the quadratic epek method is proved in hermite positive definite matrix. then the condition of hermite positive definite matrix is extended to the condition of the positive - definable matrix

    （ 2 ）在新型二次pe _ k方法的基礎上，討論了新型二次pe _ k方法的外插迭代二次epe _ k方法的收斂性，證明了當系數矩陣為對稱正定矩陣時二次epe _ k方法的收斂性，並將在正定矩陣條件下收斂的情形推廣到了可正定化矩陣的情形。
  15. Fifthly, the parameter control methods for solving convex programming, especially linear programming and convex quadratic programming, are discussed and its convergence iv is probed

    五是研究了凸規劃包括線性規劃和凸二次規劃的參數控制演算法及其收斂性。
  16. Abstract : an algorithm of indefinite quadratic programming over unbound domain is presented ; the indefi nite quadratic programming is translated into a series of convex programming and the convergence of algorithm is discussed

    文摘:給出了無界域上不定二次規劃的一個演算法，該演算法將不定二次規劃轉化為一系列凸二次規劃，並證明了演算法的收斂性
  17. Abstract : in this paper, the nonlinear optimal control problem connected with the ordinary differential system is considered, two modifications to the standard gradient procedures are constructed. the presented methods are based on the qualitative approximations of the cost functional. for linear - quadratic problems, the modifications have the property of the nonlocal improvement in contrast to the standard gradient procedures. some results relating to the convergence of the new methods are proved

    文摘:討論非線性最優控制問題構造的標準梯度方法的兩種改進方法.文中的方法是以罰函數的有效近似為基礎，與標準梯度方法相比，該方法對于非線性二次問題具有非局部的特點，同時給出相關收斂結果
分享友人
分享到 Line

分享到臉書