極小問題 的英文怎麼說

中文拼音 [jíxiǎowèntí]
極小問題 英文
minimum problem
  • 極 : i 名詞1 （頂點; 盡頭） the utmost point; extreme 2 （地球的南北兩端; 磁體的兩端; 電源或電器上電流...
  • 小 : Ⅰ形容詞1 （體積、面積、數量、強度等不大） small; little; petty; minor 2 （年紀小的; 年幼的） youn...
  • 問 : Ⅰ動詞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. Miss glover suffered terribly from nervousness, and the notion of broaching so delicate a subject caused her indescribable tortures.

    格洛弗小姐由於神經緊張而極度痛苦，那種認為要對非常棘手的問題擔風險的想法使她感到有說不出的苦惱。
  2. Contractible income gap, still should advocate improve efficiency through competing, allocate in on emphasize competing, allocate in 2 on pay attention to fairness, solve problem of polarization of social member distribution of personal incomes with this, 12 central files already were reflected somewhat in this respect

    縮小收入差距，仍要提倡通過競爭提高效率，在一次分配上強調競爭，在二次分配上注重公平，以此解決社會成員個人收入分配兩極分化問題，中心12號文件在這方面已有所體現。
  3. Establishing an human spine dynamic model is an significan event to study spine injured biomechanics of pilot " s ejective injury, parachute opening, landing and study the endurance to impact loading on human spine. in this paper, the huston " s method of kane " s equations is developed so that it can be applied to the multibodysystem including translation between the bodyies. the dynamic model of human spine is provided basing on these theories, while the big movement of spine is considered. the deformation of vetebra is far smaller comparing with the intervetebra disc, so the spine is considered into multibodysystem including rigid bodies ( vetebra ) and the flexible bodies ( intervetebra disc ). the computer solution correspond with the results of the large scale human impact test. the rigid coefficient factors and the damping factor of intervetebra joints are obtained

    人體脊柱動力學模型的建立對研究飛行員彈射救生、傘兵跳傘開傘、著陸等脊柱損傷的生物力學以及研究人體脊柱耐受沖擊載荷的極限問題都具有重要意義.首先發展了凱恩方程的休斯頓方法，使其可應用於變形體連接的多體系統，並以此理論為依據建立人體整椎脊柱沖擊動力學模型，此時考慮脊柱的大位移運動，每個椎骨的變形相對椎間盤的變形小得多，把脊柱看成由剛體（椎骨）和變形體（椎間盤）組成的多體系統.並以大型真人坐姿沖擊實驗結果進行了擬合，最後得到腰椎間關節剛度系數因子和阻尼系數因子
  4. The subject of the theorems, which today we would describe as maxima and minima problems, was novel in greek mathematics.

    這些定理的主題就是今天所謂的極大極小問題，它在希臘數學里是新穎的。
  5. Inside our heads, all manner of small problems and minor negative attributes assume enormous significance

    形形色色的小問題以及次要的消極因素，在我們的腦子里卻顯得特別巨大，十分重要。
  6. The learning process of rbf network is much faster and easier than that of bp network, and not existing local minimum areas

    徑向基函數神經網路的訓練時間遠小於反向傳播神經網路，且不存在局部極小問題。
  7. This dissertation studies mainly theories and according numerical implementation of a class of dual algorithms for nonlinear optimization problems, including unconstrained minimax problems and constrained nonlinear programming problems

    本文主要研究非線性優化中的一類對偶演算法，包括無約束極大極小問題的對偶演算法和約束非線性規劃問題的一類對偶演算法的理論與相應的數值實現。
  8. A nonmonotone line search algorithm for nonsmooth discrete minimax problem

    關於一類非光滑極大極小問題的非單調線性搜索演算法
  9. The second chapter reveals the mathematical essence of entropy regularization method for the finite min - max problem, through exploring the relationship between entropy regularization method and exponential penalty function method. the third chapter extends maximum entropy method to a general inequality constrained optimization problem and establishes the lagrangian regularization approach. the fourth chapter presents a unified framework for constructing penalty functions by virtue of the lagrangian regularization approach, and illustrates it by some specific penalty and barrier function examples

    第一章為緒論，簡單描述了熵正則化方法與罰函數法的研究現狀；第二章，針對有限極大極小問題，通過研究熵正則化方法與指數（乘子）罰函數方法之間的關系，揭示熵正則方法的數學本質；第三章將極大熵方法推廣到一般不等式約束優化問題上，建立了拉格朗日正則化方法；第四章利用第三章建立的拉格朗日正則化方法，給出一種構造罰函數的統一框架，並通過具體的罰和障礙函數例子加以說明。
  10. Experiments results show that the modified bp arithmetic not only has shorted study time, high efficiency, but also meet with the error goal, improve the generalization capability. so it can averted from getting into local minimum in some degree and achieve global optimization

    通過對bp改進模型的比較的研究及實驗證明：改進的bp演算法縮短了學習時間、提高了學習效率，不僅滿足了誤差目標的要求，而且提高了網路的泛化能力，在一定程度上避免了學習中的局部極小問題，實現了全局優化。
  11. Firstly, the duality principle is used to change the linear program problem into the minimax problem, an interval extension of the adjustable entropy function is set up and its order of convergence is discussed

    首先利用對偶理論將線性規劃問題轉化為極大極小問題，建立並討論了調節熵函數的區間擴張及其收斂階。
  12. In this thesis, we extend the entropy regularization method in two ways : from the min - max problem to general inequality constrained optimization problems and from the entropy function to more general functions

    本文從兩個方面發展了這種熵正則化方法，即將其從極大極小問題推廣到一般不等式約束優化問題上和用一般函數代替熵函數作正則項，建立新的正則化方法。
  13. We apply these dual algorithms to solve a large number of nonlinear optimization problems with relative small scale, including inequality constrained optimization problems, unconstrained minimax problems and general constrained optimization problems

    用這些演算法計算大量的規模不是很大的不等式約束優化問題，無約束極大極小問題，一般約束優化問題，數值結果表明它們是有效的
  14. Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems. a dual algorithm for solving unconstrained minimax problems, based on the penalty function of bertsekas ( 1982 ), is presented. we prove that there exits a threshold of the penalty parameter satisfying that the sequences generated by the dual algorithm converge locally to the kuhn - tuker point of the unconstrained minimax problems when the penalty parameter is less than the threshold

    第3章給出無約束極大極小問題的一個對偶演算法的收斂理論，給出一個基於bertsekas （ 1982 ）罰函數的求解無約束極大極小問題的對偶演算法，證明罰參數存在一個閥值，當罰參數小於這一閥值時，該對偶演算法產生的序列局部收斂到問題的kuhn - tuker點，並建立了參數解的誤差估計式，同樣估計了罰函數的hesse陣的條件數，它也依賴于罰參數。
  15. Solving nonlinear minimax problems by gray coding genetic algorithm

    解非線性極大極小問題的格雷碼加速遺傳演算法
  16. Maximum entropy method is an effective smoothing one for the finite min - max problem, which, by adding shannon ' s informational entropy as a regularizing term to the lagrangian function of min - max problem, yields a smooth function that uniformly approaches the non - smooth max - valued function

    極大熵方法是解有限極大極小問題的一種有效光滑化法，它通過在極大極小問題的拉格朗日函數上引進shannon信息熵作正則項，給出一致逼近極大值函數的光滑函數。
  17. A new method for minimax problem

    求解極小極大問題的一個新演算法
  18. 2. on the base of detailedly analysing the fourier neural networks, we find this neural networks have the characteristic which can transform the nonlinear mapping into linear mapping. so, we improve the original learning algorithm based on nonlinear optimization and propose a novel learning algorithm based on linear optimization ( this dissertation adopts the least squares method ). the novel learning algorithm highly improve convergence speed and avoid local minima problem. because of adopting the least squares method, when the training output samples were affected by white noise, this algorithm have good denoising function

    在詳細分析已有的傅立葉神經網路的基礎上，發現傅立葉神經網路具有將非線性映射轉化成線性映射的特點，基於這個特點，對該神經網路原有的基於非線性優化的學習演算法進行了改進，提出了基於線性優化方法（本文採用最小二乘法）的學習演算法，大大提高了神經網路的收斂速度並避免了局部極小問題；由於採用了最小二乘方法，當用來訓練傅立葉神經網路的訓練輸出樣本受白噪聲影響時，本學習演算法具有良好的降低噪聲影響的功能。
  19. An effective algorithm for nonlinear constraint max - min problems

    非線性極大極小問題的一個有效演算法
  20. Although the hcf algorithm is more accurate than the icm algorithm, it will cost more computer time. according to the simulation, the problem about local minima in this paper cannot be solved by this method

    Hcf方法收斂的精確性是以犧牲演算法的計算時間為代價的，並且，它也沒有完全解決本文的局部極小問題。
分享友人
分享到 Line

分享到臉書