inequality n. 1.不平等,不平均,不平衡,不等量。 2.不相同,互异。 3.变动,变化,高低,起伏。 4.【数学】不等式;【天文学】均差。 5.(平面等的)不平坦。 6.不胜任。 an inequality of temperature 温度上的变化。 the inequality of the climate 气候上的变动。 inequality in size 大小不同。 the inequality between the rich and the poor 贫富不均。 one's inequality to a task 不胜任。
constraint n. 1.强迫,拘束。 2.约束,压抑,拘泥。 3.强制力。 4.紧张感[状态]。 by constraint 勉强,强迫。 feel constraint觉得局促不安,感受压迫。 show constraint显得局促。 under [in] constraint 被迫,不得不;被束缚着。
problem n. 1.问题,课题;疑难问题;令人困惑的情况。 2.【数、物】习题;作图题。 3.(象棋的)布局问题。 the problem of unemployment 失业问题。 His whole conduct is a problem to me. 他的一切行为我都不理解。 adj. 1.成问题的;难处理的。 2.关于社会问题的。 a problem child 【心理学】问题儿童;难管教的孩子。 a problem novel [play] (反映社会问题等的)问题小说[戏剧]。 sleep on [upon, over] a problem 把问题留到第二天解决。
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 本文提出并分析一种解决不等式约束最优化问题的修改的罚函数法,这一方法综合利用修改的罚函数和拉格朗日法。
The model of dwell function synthesis of planar six - bar mechanism in the dissertation is decomposed into two relatively independent sub - questions . the first one is to evaluate the characteristic of points on moving rigid body , whose mathematics model is a kind of special non - differential max - mini optimal problem with inequality constraints 对于误差评定,本文利用加权理论,对要求综合的平面六杆机构提出了在保证间歇部分精度要求的条件下,使非间歇部分误差尽可能小的评价思想。
For applying the hybrid optimization algorithm to solve the optimization problem with constraints , a self - adaptive penalty strategy for handling the constraints is designed , which is used to convert the optimization problem with inequality constraints and equality constraints to the one only with the upper and lower bound constraints of the decision variables 为了便于应用混合优化算法对约束优化问题进行求解,设计了一种处理约束条件的自适应惩罚策略,用于将具有不等式约束和等式约束的优化问题转变为仅包含决策变量上、下限约束的优化问题。
Chapter 2 establishes the theoretical framework of a class of dual algorithms for solving nonlinear optimization problems with inequality constraints . we prove , under some mild assumptions , the local convergence theorem for this class of dual algorithms and present the error bound for approximate solutions . the modified barrier function methods of polyak ( 1992 ) and the augmented lagrange function method of bertsekas ( 1982 ) are verified to be the special cases of the class of dual algorithms 第2章建立求解不等式约束优化问题的一类对偶算法的理论框架,在适当的假设条件下,证明了该类算法的局部收敛性质,并给出近似解的误差界,验证了polyak ( 1992 )的修正障碍函数算法以及bertsekas ( 1982 )的增广lagrange函数算法都是这类算法的特例。