超線性收斂 的英文怎麼說

中文拼音 [chāoxiànxìngshōuliǎn]
超線性收斂 英文
superlinear convergence
  • 超 : Ⅰ動詞1 （越過; 高出） exceed; surpass; overtake 2 （在某個范圍以外; 不受限制） transcend; go beyo...
  • 線 : 名詞1 （用絲、棉、金屬等製成的細長的東西） thread; string; wire 2 [數學] （一個點任意移動所構成的...
  • 性 : Ⅰ名詞1 （性格） nature; character; disposition 2 （性能; 性質） property; quality 3 （性別） sex ...
  • 收 : Ⅰ動詞1 （把攤開的或分散的事物聚集、合攏） put away; take in 2 （收取） collect 3 （收割） harvest...
  • 斂 : Ⅰ動詞1 （收起; 收住） hold back; keep back 2 （約束） restrain 3 （收集; 徵收） gather; collect; ...
  • 線性 : [數學] [物理學] linear; linearity線性代數 linear algebra; 線性方程 linear equation; 線性規劃 line...
  • 收斂 : 1 （減弱或消失） weaken or disappear 2 （約束言行） restrain oneself 3 [數學] convergence; constr...
  1. 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矩陣的結構以提高演算法的效率，該演算法的顯著優點是對于零殘量問題具有二階收斂性而對于非零殘量問題具有超線性收斂性。
  2. Considering the one - sidedness and inaccuracy of knowledge discovery only from single - color database, an approach is proposed to discover knowledge from 1331 groups of mix - color database with partial least - square regression, based on measuring and learning 400 groups of single - color database. by this method, the mean error decreases when converting from rgb to cmyk, the precision of color matching is improved, and the automatic and general problem in color matching is further solved

    本文基於統計學習理論構造了一種快速自適應隨機搜索演算法，證明了演算法的收斂性.給出了一種簡易實用的寬帶天線匹配設計新方法.應用該自適應演算法進行天線匹配設計，不僅演算法簡單，易於編程實現;而且能夠快速設計出具有較好性能的匹配網路，非常適用於各種短波、超短波天線的匹配設計問題
  3. Superconvergence analysis of linear element in 3 - d on anisotropic meshes

    各向異性網格下三維線性元的超收斂性分析
  4. Third, by means of smale, s point estimates theorem, the existence and the convergence theorem of broyden, s iteration is given, the method has less calculation and the speed of super linear convergence for solving the nonlinear equations with nondifferential terms under the point estimates or weak condition

    第三，本文利用smale提出的點估計理論，給出了在點估計和弱條件下，用計算量小、具有超線性收斂速度的broyden方法來求解帶不可微項的非線性方程，給出了存在性收斂性定理及相應的證明。
  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. Using the comparison principle, it is proved that the proposed method is of superlinear convergence

    利用比較原理，間接證明該演算法是一種具有超線性收斂性的近似牛頓法。
  7. That is, the convergence speed of the em algorithm becomes much fast as the overlap measure of gaussians in the mixture tends to zero, which conforms to simulation results and practical applications

    當這一重疊度趨向于零時，演算法的收斂速度漸進地趨向于超線性，變成為一個快速演算法。這與實際應用是相符合的。
  8. We show that the hybrid method is globally and superlinearly convergent for nonzero residual problems and globally and quadratically for zero resi dual problems

    因此，該雜交方法對于零殘量問題是二階收斂的，而對于非零殘量問題是超線性收斂的。
  9. Under mild conditions, we prove the global and superlinear convergence of the method

    在較弱的條件下，得到了演算法的全局收斂性及其超線性收斂性。
  10. A feasible sqp algorithm with superlinear convergence for inequality constrained optimization

    不等式約束優化一個具有超線性收斂的可行序列二次規劃演算法
  11. Lc1 unconstrained optimization problem was discussed in the second chapter, giving a new trust region method and proving its global convergence and superlinear convergence under some mild conditions

    給出了一個新的信賴域演算法，並在一定的條件下證明了演算法的全局收斂性和局部超線性收斂性。
  12. The general shamanskii modification of the newton method is defined by the iteration and the global and superlinear convergence of the general shamanskii modification of the newton method are proved in this dissertation

    我們不僅證明了改進的sha一mansk燈修正牛頓法的全局收斂性，而且也證明該方法具有超線性收斂速度
  13. In the third chapter we discuss lc1 constrained optimization problem. to solve it, we turn it into nonsmooth equations, utilizing inexact theory we give an inexact generalized newton ' s method and under some mild conditions we prove that it is global convergence and superlinear convergence

    首先將其約束問題的求解轉化為非光滑方程組的求解，然後利用不完全求解理論給出了一個非精確的廣義牛頓演算法，在一定的條件下證明了演算法的全局收斂性和局部超線性收斂性並給出了lc ~ 1非線性約束問題的收斂性條件。
  14. The convergence of the refined non - interior continuation method for ncps is analyzed, the same global linear convergence as chen - xiu ' s is obtained

    得到了與chen - xiu同樣的全局線性收斂，推廣了chen - xiu的局部超線性收斂到局部二次收斂。
  15. Under mild conditions, we prove that the proposed method is globally convergent. moreover, we show that after finite iterations, the unit step is always accepted, and the method locally reduces to the modified bfgs method

    在較弱的條件下，我們證明所提出的方法具有全局收斂性，此外，本文證明在有限次迭代后，單位步長總是可接受的，因此，演算法還原為mbfgs法，從而這種方法具有局部超線性收斂性。
  16. We also show that the unit steplength is essentially accepted

    並證明演算法的全局收斂性和超線性收斂性。
  17. We show the proposed algorithm is globally convergen t and locally fast convergent rate even if conditions are reasonalbe

    在合理的假設條件下，我們證明了這一演算法不僅具備整體收斂性，而且具有超線性收斂速率。
  18. Moreover, we show that if the second order sufficient conditions holds at a solution of the problem, then the method is 2 - step superlinearly convergent

    而且，我們證明：若在問題的解處二階充分條件成立，則相應的sqp演算法具有2步超線性收斂性。
  19. In this paper, we give a class of superlincarly convcngent algorithms for nonlinear programming problems with linear constrained by combining non - quasi - newton methods with the projection methods

    本文結合文[ 2 ]中的非擬牛頓法與投影類演算法，給出了求解線性約束非線性優化問題的一類具有超線性收斂的投影非擬牛頓演算法。
  20. Because three systems of equations solved at each iteration have the same coefficients, so the ammount of computation are less than that of the existing sqp algorithms. under some common conditions ( such as the second order sufficient condition ) which are used in some references, we prove that the algorithm possesses not only global convergence, but also strong convergence and superlinear convergence

    該演算法在每次迭代時所需解的三個線性方程組具有相同的系數，因此計算量要比現有的sqp方法有所減少；在與一些文獻平行的假設條件（如二階充分條件）下，論文證明了演算法不僅具有全局收斂性，而且還具有強收斂性和超線性收斂性
分享友人
分享到 Line

分享到臉書