unconstrained problem 中文意思是什麼
unconstrained problem
解釋
無約束問題- unconstrained : adj. 1. 不受強制的，自由的。2. 非強迫的，自發的，自動的。3. （態度）不勉強的，從容的。adv. -ly
- problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
-
A niched - penalty approach is used to transform this optimal kinematical design problem to an unconstrained one. a kinematic accuracy comparison of the genetic designed fine - tuning stewart platform with the quasi - newtonian designed one is made. the comparison results have shown that the kinematic accuracy of the genetic designed fine - tuning stewart platform has a much higher accuracy and a compact structure than that of the quasi - newtonian designed one, which guarantees the accomplishment of high precision trajectory tracking and reduces the disturbance of wind to the feed - supporting system
以並聯機器人jacobian矩陣的條件數為優化設計的目標函數，提出了基於遺傳演算法的並聯機器人最優運動學性能結構參數優化設計方法，採用實值遺傳演算法，對精調stewart平臺進行了優化設計，得到了最優運動學的精調stewart平臺結構參數，為實現新一代大射電望遠鏡饋源指向跟蹤系統高精度軌跡跟蹤控制奠定了堅實的基礎。 -
An algorithm of solving nonlinear coupled equations is given which transforms the solving problem to unconstrained optimization problem and the coupled equations are solved by a genetic algorithm and newton iteration
同時還給出了一種求解非線性方程組的演算法，即將非線性方程組的求解問題轉化為帶約束的優化問題，應用遺傳演算法和牛頓迭代法求解。 -
Because of substantive involvement of additional assumption on the solution space, the constrained inverse problem is more difficult to deal with and it can not be solved by unconstrained regularization without modification
因為在解決實際問題中對解空間的附加假設，若用無約束的正則化方法不加修改的解決帶約束的反問題則比較困難。 -
It is known that the vip can be reformulated as an unconstrained minimization problem through the d - gap function
我們知道，通過廣義d -間隙函數，可以將變分不等式問題轉化為一個無約束極小化問題。 -
By intro - ducing a penalty function as the following, for every e > 0, we construct a sequence of unconstrained minimization problems to approximate the constrained minimization problem. the solutions of such a sequence of unconstrained minimization problems all exist, and they converge to the solution of the constrained minimization problem in a certain sense
這列無約束極小化問題（ p _ ）的解都是存在的，並且在某種意義下收斂至原始約束極小化問題（ p ）的解，不僅如此，它們的性能指標也收斂至原始問題（ p ）解的性能指標。 -
In unconstrained optimization, we deal with the standard problem of finding the minimum of a function f : rn - r. if we assume that the function is twice continuously differentiable, many methods can be applied to find the minimum
在無約束最優化中，考慮尋找f ： r ~ n r的極小點。假設f是二次連續可微的，可以有許多方法尋找它的極小點。 -
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 ）重新用一個以經典拉格朗日函數為目標的錐優化問題來表示。 -
With merit function, the origin problem can be conformed to unconstrained or constrained minimization problems
利用merit函數的極小化變形可分為無約束和約束兩種類型。 -
In this paper, a new dynamic programming algorithm for unconstrained 2d stock cutting problem is presented
摘要本文給出了一種求解無限制板材下料問題的動態規劃解法，對該演算法的計算復雜度進行了分析。 -
The unconstrained and constrained linear matrix equations and related least squares ( l - s ) problems have been of interest for many applications, including particle physics and geology, control theory, the inverse sturm - liouville problem, inverse problems of vibration theory, digital image and signal processing, photogrammetry, finite elements and multidimensional approximation
例如在粒子物理學和地質學， sturm - liouville逆問題，自動控制理論的逆問題，振動理論的逆問題，數碼影象和信號處理，航空投影測量學，有限元及多維逼近問題等方面都有重要的作用。 -
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
給出了一個新的信賴域演算法，並在一定的條件下證明了演算法的全局收斂性和局部超線性收斂性。 -
An improvement of simulated annealing algorithm solving unconstrained optimization problem
無約束優化問題模擬退火演算法的改進 -
In this paper we reformulate gcp a sasystem of nonlinear equations, and the gcp is reformulated as unconstrained optimization problem, as for the optimization problem, the damped gauss - newton method algorithm of two kinds of steps is employed for obtaining its solution, and the global convergence analysis are given in this thesis
摘要本文將廣義互補問題轉化為一個非線性方程組問題，然後建立了gcp問題的無約束優化問題的轉化形式，對該優化問題，用兩種步長下的阻尼高斯牛頓演算法來求解，並給出了兩種情況下演算法的全局收斂性。 -
The algorithm is based on a reformulation of the complementarity problem as an unconstrained optimization. it is proved that the algorithm is globally convergent
在將互補問題轉化為一個無約束優化問題的基礎上，給出了一種求解互補問題的混合方法，證明了該演算法的全局收斂性。 -
Zhu has studied unconstrained optimal problem by combining optimal path and modified path with nonmonotonic trust region methods in [ 9 ], and the use of l2 norm by trust region method in [ 1 ] in seeking the solution of unconstrained optimization has formed simple approximate trust region path, which enlightens us to solve nonlinear programming problem by curvilinear path
朱德通在文[ 9 ]中將最優路徑和修正梯度路徑與非單調信賴域方法相結合討論無約束優化問題，且文[ 3 ]中用信賴域方法解無約束優化問題取l _ 2范數形成了形式簡單的近似信賴域路徑，此類思想啟發作者用弧線路徑來解決約束優化問題。 -
Newton - pcg algorithm is very efficient for solving the unconstrained optimization problems. we considered an integer one - dimensional optimization problem appeared in newton - pcg method. the efficiency of newton - pcg algorithm is depended on the optimal value of this problem
Newton - pcg演算法是解決無約束問題的有效方法，在該演算法中需要求解一個一維整數最優化問題，並且演算法的效率也依賴於它的最優值。 -
The lpr system processes the natural image with stochastic disturbance. the paper presents a pretreatment method able to solve the problem that the image contrast degree is too lower to our eyes because of unconstrained illumination conditions. single character image segment means that the whole license plate image will be divided into several little parts and then followed by character recognition
系統面對的是從實際場景中切割出來的車牌圖像，伴隨著很多的隨機性干擾，本文提出的針對車牌圖像的預處理過程對灰度圖像可以達到較好的處理效果，而且在一定程度上解決了由於外界光照而造成的車牌圖像對比度低的問題。
分享友人