全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 inequality constrains 在 数学 分类中 的翻译结果: 查询用时：0.157秒
 历史查询

 inequality constrains 不等式约束(2)不等式约束(2)
 不等式约束
 Finally, we spark off a new thinking on the nonlinear single objective and multi-objective programming problems with mixed constrains:using the vax variable,we convert the inequality constrains to the equality ones, and then solve it by the desecnding algorithm with accurate one dimension searching method. 最后,针对具有混合约束的非线性单目标和多目标的规划问题,本文提出了一种新的思路:先引入松弛变量,将不等式约束转化为等式约束,再用带搜索的降维算法进行求解。 短句来源 The KKT conditions of a nonlinear programming with linear inequality constrains can be transformed into a system of equations by NCP function. Then it is smoothed by Entropy smoothing function. 带不等式约束的非线性规划,其KKT条件可以通过NCP函数转化为一个非光滑的方程组,然后用熵光滑化函数光滑化,得到一个带参数的方程组. 短句来源
 不等式约束
 Finally, we spark off a new thinking on the nonlinear single objective and multi-objective programming problems with mixed constrains:using the vax variable,we convert the inequality constrains to the equality ones, and then solve it by the desecnding algorithm with accurate one dimension searching method. 最后,针对具有混合约束的非线性单目标和多目标的规划问题,本文提出了一种新的思路:先引入松弛变量,将不等式约束转化为等式约束,再用带搜索的降维算法进行求解。 短句来源 The KKT conditions of a nonlinear programming with linear inequality constrains can be transformed into a system of equations by NCP function. Then it is smoothed by Entropy smoothing function. 带不等式约束的非线性规划,其KKT条件可以通过NCP函数转化为一个非光滑的方程组,然后用熵光滑化函数光滑化,得到一个带参数的方程组. 短句来源
 “inequality constrains”译为未确定词的双语例句
 The Generalized Semi-Infinite Programming with Inequality Constrains 带不等式约束的广义半无限规划 短句来源 (2) This paper considers nonsmooth multiobjective programming problems with inequality constrains involving locally Lipschitz functions. (2)研究了目标函数和约束函数是局部Lipschitz函数的非光滑多目标优化问题。 短句来源 Three optimality conditions are given for an optimization problem subject to qua-sidifferentiable inequality constrains. And their equivalence properties are proved. 本文给出了具有不等式约束的拟可微优化问题的三个优化条件,并且证明了它们的等价性。 短句来源 Some general convexity concepts in Banach spaces are defined. Mond - Weir type dual and Wolfe type dual for any dimension programming with equality and in inequality constrains is discussed. 在Banach空间中定义了ρ－不变凸的概念，讨论了具等式和不等式约束的任意维规划的Mond－Weir型对偶与Wolfe型对偶． 短句来源

我想查看译文中含有：的双语例句

 inequality constrains
 Inequality constrains on the measured variables can be handled using quadratic programming methods.
 with the help of a semi-infinite Gnrdan type alternative theorem, this paper offers the necessary optimality conditions for solutions of multiobjective programming with inequality constrain. It also offers sufficient conditions for solutions with the usual convexity assumption replaced by generalized invex conditon. This research improves the results in [ 1-2 ]. 本文利用半无限Gordan型选择定理,对近似拟可微的带不等式约束的函数给出了多目标规划解的必要条件。同时在一类新的广义凸性条件下给出了解的充分条件.此项研究改进了[1-2]中的结果。 A kind of penalty functiton method is proposed for the following nonlinear inequality constrained programming: min f(x) s. t g_j(x)≤0 j=1,...,r where f(x),g_j(x),j=1,...,r, are Lipschitz continuous and ρ-invex but not necessarily differentiable. The algorithm transforms the problem into a series of unconstained nonsmooth optimization ones whose algorithm are simple and robust. It is also proved convergent under some mild conditions. 本文对于一类不可微非线性规划问题提出了一种新的罚函数算法,并建立了收敛定理。 This paper presents an algorithm for nonlinear inequality constrained optimization problems which begins at any starting point.The search direction is formed by using gradient projection, and the search directions and functions are controlled effectively by the sign functions. Such that the direction will become feasible descent direction, and the search function will change into the objection function from penalty function whenever some iteration point go into the feasible region. (So call it subfeasible... This paper presents an algorithm for nonlinear inequality constrained optimization problems which begins at any starting point.The search direction is formed by using gradient projection, and the search directions and functions are controlled effectively by the sign functions. Such that the direction will become feasible descent direction, and the search function will change into the objection function from penalty function whenever some iteration point go into the feasible region. (So call it subfeasible direction method.) It is shown that this method possesses global convergence and the penalty parameters are adjusted only finite times under mild conditions. 本文给出非线性不等式约束最优化问题的一个初始点可任取的算法。利用梯度投影构造搜索方向,并使用符号函数对搜索方向和搜索函数进行有效的控制。使得一旦迭代点进入了可行域,其后的方向将成为可行下降方向,搜索函数将由罚函数变为原问题的目标函数(故称之为次可行方向法)。在较为温和的条件下证明了方法的全局收敛性,及罚参数只需进行有限次调整。 << 更多相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关inequality constrains的内容 在知识搜索中查有关inequality constrains的内容 在数字搜索中查有关inequality constrains的内容 在概念知识元中查有关inequality constrains的内容 在学术趋势中查有关inequality constrains的内容
 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社