constrained optimization method 中文意思是什麼

constrained optimization method 解釋
約束優化方法
  • constrained : adj. 被強迫的；受壓制的；不自然的，勉強的。 a constrained manner 不自然的[局促的]樣子。 a constrained smile （勉強做作的）苦笑。adv. -ly
  • optimization : n. 最佳化，最優化。
  • method : n 1 方法，方式；順序。2 （思想、言談上的）條理，規律，秩序。3 【生物學】分類法。4 〈M 〉【戲劇】...
  1. Relative key concept and technique of this method was described in detail in this paper, such as the decomposition of balance matrix, the modes of self - stress, the modes of inextensional mechanisms, the analysis model of optimization under linear constrained condition, the integration of constrained matrix

    文中對桁架理論的奇異值分解法、自應力模態、機構位移模態、有約束線性優化數學模型、約束矩陣集成等關鍵概念和技術進行了詳細的推導說明。
  2. However, some of them are restrictive. for some of these methods, the convergence is not known in this paper, based on a modified bfgs update formula proposed by li and fukushima, we propose a modified bfgs method for solving equality constrained optimization

    本文在li - fukushima提出的求解無約束問題的修正bfgs公式的基礎上，對求解等式約束問題的sqp演算法，提出一個保證qp子問題的目標函數的hessian陣的正定性的修正方案。
  3. 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

    本文提出並分析一種解決不等式約束最優化問題的修改的罰函數法，這一方法綜合利用修改的罰函數和拉格朗日法。
  4. Considering chance constrained programming is a well developed stochastic optimization method which can describe risk in an explicit manner, with the premised market trading protocols, a chance constrained programming based model for describing the optimal bidding strategies of distribution companies in a pool co - type transmission and distribution separated electricity market is presented, and solved by genetic algorithm

    鑒于機會約束規劃作為一類快速發展的隨機優化方法能以顯式的形式刻畫風險，針對以聯營體為基礎的輸配分開電力市場，在假設的市場交易規則基礎上，構造了在現貸市場中基於機會約束規劃的供電公司最優報價策略模型，並採用遺傳演算法求解。
  5. In the second chapter some problems for degree reduction of bezier curves and surfaces are studied. in this chapter, degree reduction of bezier curves with points constraints is proposed and the new approach of constrained optimization is brought in light. the stepwise method for degree reduction of rectangular bezier surfaces is further discussed

    第二章研究b zier曲線曲面的降階逼近問題，在這一章中，提出了b zier曲線的點約束降階逼近新問題，並給出了約束優化方法；討論了張量積b zier曲面的逐步降階逼近新方法，此方法的優點是直接利用b zier曲線的降階逼近方法解決張量積b zier曲面的降階逼近問題。
  6. Modified constrained variable metric method is adopted in this optimization, and the application of perturbation method in the re - analysis of the structure is studied

    另外，還對結構重分析中攝動法的應用進行了討論。
  7. 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

    第一章為緒論，簡單描述了熵正則化方法與罰函數法的研究現狀；第二章，針對有限極大極小問題，通過研究熵正則化方法與指數（乘子）罰函數方法之間的關系，揭示熵正則方法的數學本質；第三章將極大熵方法推廣到一般不等式約束優化問題上，建立了拉格朗日正則化方法；第四章利用第三章建立的拉格朗日正則化方法，給出一種構造罰函數的統一框架，並通過具體的罰和障礙函數例子加以說明。
  8. 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非線性約束問題的收斂性條件。
  9. This paper presents an interior trust region method for linear constrained lc ^ 1 convex optimization problems

    摘要本文提出一種解線性約束凸規劃的數值方法。
  10. 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

    本文從兩個方面發展了這種熵正則化方法，即將其從極大極小問題推廣到一般不等式約束優化問題上和用一般函數代替熵函數作正則項，建立新的正則化方法。
  11. Chapter 1, making use of the technique of pivoting operation, the technique of sequential systems of linear equations of studying constrained optimization problems and the idea of strongly subfeasible directions method and, several new algorithms for systems of nonlinear inequalities are presented

    第一章，藉助于轉軸運算技術，序列線性方程組技術以及強次可行方向法思想，建立了非線性不等式組的序列線性方程組演算法，演算法的搜索方向由有唯一解的線性方程組的解及其校正產生。
  12. A dynamic approach for the minimization subproblem in alm method is discussed, and then a neural network iterative algorithm is proposed for general constrained nonlinear optimization. 3

    使用增廣lagrange乘子法求解時，雖然可以避免罰參數無限增大的弊病，但同時也提出了一個難以求解的子命題。
  13. In the first place, the thesis analyzes the position and function of buy based on supply chain of the food processing industry, studies the characteristics of buy of the food processing industry based on supply chain, and discusses the relations between food processing business enterprise and its supplier. secondly, certain buy optimization model of multi - suppliers and one food processing enterprise is established with ration method, and then this model is expanded to multi - suppliers and multi - food processing enterprises. thirdly, if regarding the production ability of the supplier and the demand of food processing enterprise as fuzzy variables, the optimization model for multi - suppliers and multi - food processing enterprises based on supply chain is established with fuzzy chance constrained programming

    分析采購在食品加工業供應鏈中的地位與作用，探討了基於供應鏈的食品加工業采購的特點，研究了食品加工企業與其供應商之間的關系；採用定量方法，建立多供應商和單一食品加工企業的確定性采購模型，擴展到多供應商和多食品加工企業的確定性采購模型，最後，充分考慮不確定性因素，把供應商的生產能力、食品加工企業的需求量看作是模糊的變量，運用模糊機會約束規劃建立了基於供應鏈的多供應商和多食品加工企業的不確定性采購優化模型。
  14. Taking all the interval number s in the equations as optimal design variables and representing the lower and th e upper bounds of each interval number as the boundary constrain of the variable respectively, the maximum and the minimum of various components of the solution are achieved by using the constrained optimization method

    將方程組中的所有區間數都作為設計變量，區間量的變化區間作為相應的設計變量的邊界約束，運用約束優化法求出方程組解的各元素的最大值和最小值。
  15. At present, constrained optimization methods may be classified to two classes, one is search method which firstly asserts whether the current point is an optimal point, if the point is not, then we must choose search directions, and along the search direction, find the next iterative point which make the objective function or merit function to decrease

    目前的約束優化演算法可以分成兩大類，一類是搜索演算法，這種演算法首先判斷當前點是否為最優點，若非最優點則要確定搜索方向，然後沿此方向確定一個使目標函數或評價函數下降的點。這種演算法一般為下降演算法，如可行方向法、約束變尺度法等。
  16. A trust region method with a conic model for nonlinearly constrained optimization

    解非線性優化問題的錐模型信賴域方法
  17. For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization, a heuristic search method is proposed, in which based on minimum spanning tree, degrees of vertices over the constrained degrees are reduced to the required state

    摘要針對網路設計和優化中度約束最小生成樹問題，提出了一種基於貪心思想的啟發式演算法求解度約束最小生成樹。
  18. A new method was given out in this paper, which is based on the singular value decomposition of the balance matrix of truss, followed by the method of optimization under linear constrained condition. an analysis program for this method was developed. the rightness o f t his method w as proven by the analysis and verify of engineering example

    本文從桁架理論的奇異值分解出發，結合有約束線性優化方法，提出了解決這一問題的另一途徑，編制了相應的分析程序，經過算例分析與驗證，證明了該方法的正確性。
分享友人
分享到 Line

分享到臉書