constrained optimization 中文意思是什麼
constrained optimization
解釋
約束優化- constrained : adj. 被強迫的；受壓制的；不自然的，勉強的。 a constrained manner 不自然的[局促的]樣子。 a constrained smile （勉強做作的）苦笑。adv. -ly
- optimization : n. 最佳化，最優化。
-
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系統轉化為等價的非光滑方程組。 -
The parameter control methods are very similar to penalty function methods, both of them are to solve constrained optimization problems by solving a series of sub - unconstrained optimization problems. but parameter control methods are different from penalty function methods. firstly, the penalty coefficient of penalty function methods are preassigned, while the parameters of parameter control methodsare generated automatically according to some rule prescribed
參數控制演算法雖然與罰函數法非常類似，都是通過求解一系列無約束極小化問題來逼近約束優化問題的最優解，但罰函數法中的罰因子是預先設定的，而參數控制演算法中的參數是自動產生的。 -
The topics covered in this course include : unconstrained optimization methods, constrained optimization methods, convex analysis, lagrangian relaxation, nondifferentiable optimization, and applications in integer programming
這門課程的主題包括：無限制最適化方法，限制最適化方法，凸分析，拉格朗日鬆弛法，不可微分函數最適化，以及在整數規劃上的應用。 -
The first part comprises industrial pta oxidation process modeling, residual fluid catalytic cracking process modeling, complex distillation modeling and analysis, the application of pta oxidation process soft - sensor technology. in the second one, the infeasibility degree based genetic algorithm is proposed to handle constrained optimization problem in engineering cases and the neighborhood and archive based genetic algorithm and its variant are proposed to treat the multi - objective optimization problem. with that, the pta oxidation process is regarded as a benchmark for the application of the proposed multi - objective optimization genetic algorithm
論文內容分為兩部分，第一部分對包括三個典型的工業過程， pta氧化反應器、渣油催化裂化反應系統和復合式精餾塔進行分析、建模以及pta氧化過程的軟測量工程實施；第二部分分別提出了基於進化演算法解決工業過程中普遍存在的約束優化問題和多目標優化問題的過程優化演算法? ?基於不可行度選擇遺傳演算法和基於鄰域和存檔操作遺傳演算法，並利用該演算法對工業pta氧化過程操作進行多目標優化研究。 -
So it is proved that the working model is right, and on the basis, the influences of the compression ratio and fuel injection advance angle on the diesel engine ' s combustion performance are studied. ( 2 ) energy resource and environment protection are two important problems that diesel engine is faced with. so in this paper the constrained optimization is studied in order to decrease fuel consumption within the limitation of the regulation on exhaust emission and power output
（ 2 ）能源和環境保護是柴油機存在和發展的兩大問題，因此本文在滿足排放法規及柴油機動力性的基礎上，以降低油耗為主要研究目標，進行有約束條件的優化計算，並提出了一種新的柴油機工作過程優化計算方法? ?非線性回歸?網格法。 -
Thus, inversion reliability and accuracy of multiparametric identification can be enhanced. then, based on the direct back analysis program dbapm of japan edition in construction forecast, the constrained optimization back analysis program cobap is developed. and the more reliable and accurate inversion forecast can be obtained when cobap is used in information construction and design in geotechnical engineering
基於上述研究，在日本版的施工預報直接反分析程序dbapm基礎上，擴充編製成了約束優化反分析程序cobap ，通過dbapm程序和cobap程序的數值反演比較及工程應用，說明cobap程序在信息化施工與設計領域具有更為合理可靠的反演預報功能與應用價值。 -
In this thesis we propose a scaling trust region interior point algorithm for linear constrained optimization subject to bounds on variable
本文將提出一種仿射變換的信賴內點演算法解決變量有界的線性等式約束優化問題。 -
Artificial fish - swarm algorithm for solving constrained optimization problems
求解約束優化問題的人工魚群演算法 -
The heuristic analysis, some concepts and theorems of constrained optimization are employed, e. g., linear feasible direction ( lfd ), and then the proof is first provided for the uniqueness, i. e., maximum nongaussianity is the sufficient and necessary condition to independent source recovery. moreover, based on the conclusion of the uniqueness of maximum nongaussianity, the paper also proposes an alternative but straightforward approach to the proof for the well known “ one - bit - matching ” conjecture presented in multi - unit approaches
和基於啟發性分析等傳統方法和結論比較，文中引入了線性化可行方向（ linearfeasibledirection ， lfd ）等約束優化概念和理論，首次給出了基於峭度的最大非高斯估計的唯一性證明，指出最大非高斯估計是獨立源提取的充分和必要條件。 -
The kinematic performance of the macpherson suspension on a real vehicle is studied, and the changes of the front wheel alignment and the motion of the front wheel in the longitudinal and the transversal directions are figured. based on the requirements of general layout, a constrained optimization design model is set up with the steering cross rod ball joint position as the optimization variables ( design parameters ), and the sum of steering cross rod length interference while the left front wheel turning and bouncing as the objective function. and the optimization results are worked out by programming on computer
針對一種實際車型上的麥弗遜式懸架，計算分析了轉向輪跳動時前輪定位角和車輪橫向、縱向滑移量的變化情況，並根據實際車型上麥弗遜式懸架的空間布置要求，建立了以轉向橫拉桿斷開點空間位置坐標為優化變量，轉向橫拉桿斷開點空間布置坐標可變化范圍為約束條件，車輪轉向和跳動時轉向橫拉桿長度干涉量為目標函數的約束優化設計模型。 -
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陣的正定性的修正方案。 -
Solution to constrained optimization problems in fuzzy expert system
模糊專家系統中約束最優化問題求解 -
Research of solving bound constrained optimization of nonlinear programming with orthogonal design
用正交設計方法求解非線性規劃的區間約束最優化問題 -
In this paper, we are concerned with the sequence quadratic programming ( sqp ) methods for solving constrained optimization problems
本文研究求解約束最優化問題的序列二次規劃演算法（ sqp演算法） 。 -
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
本文提出並分析一種解決不等式約束最優化問題的修改的罰函數法，這一方法綜合利用修改的罰函數和拉格朗日法。 -
Secondly, the penalty coefficient may converge to infinity in many situations when the iterative point is closely near the bound of feasible set, while the parameters are bounded if the solution set of constrained optimization is nonempty, which is available for numerical computation
另外在很多情況下，罰函數法中的罰因子當迭代點接近可行域邊界時趨于無窮大，而參數控制演算法中，只要約束優化問題有最優解，則參數是有界的，這對數值計算是有利的。 -
To circumvent the non - differentiable difficulty caused by the positive homogeneously function that is involved in an equivalent unconstrained formulation for general inequality constrained optimization problems, we turn to the classical lagrangian function and redefine m ( x ) by a conic optimization problem with the lagrangian as the objective function
為了克服不可微正齊次函數（ ? | r _ - ~ m ）給約束優化問題的等價無約束形式求解帶來的困難，我們將其目標函數m （ x ）重新用一個以經典拉格朗日函數為目標的錐優化問題來表示。 -
Immune chaotic algorithm for constrained optimization problems
約束優化問題的免疫混沌演算法 -
On nonlinear constrained optimization
非線性約束優化問題 -
A trust - region algorithm for nonlinear constrained optimization problem
解非線性約束優化問題的依賴域演算法
分享友人