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

 convex programs 的翻译结果: 查询用时：0.197秒
 在分类学科中查询 所有学科 数学 铁路运输 更多类别查询

 历史查询

 convex programs 凸规划(6)凸规划问题(2)
 凸规划
 CONE SPLITTING ALGORITHM FOR CONVEX PROGRAMS WITH AN ADDITIONAL REVERSE CONVEX CONSTRAINT 带有反凸约束凸规划的锥分解算法 短句来源 This paper discusses the duality for multiobjectibe cone convex programs and nonconvex programs, some of duality for Hartley proper efficient solution are proved. 本文在Hartley真有效解意义下讨论了多目标锥凸规划和非凸规划的对偶性,给出了几个对偶性结果。 短句来源 A New Inexact Interior Proximal Point Algorithm for Solving Convex Programs 求解凸规划问题的一种新的不精确内邻近点方法 短句来源 A supporting-cutting-plane algórithm for a class of linear semi-infinite programming problems are given inthis paper. It is based on the cutting-plane algorithm of Veinott for convex programs. 本文以 Veinott 的求解凸规划的割平面法为基础,给出了求解一类线性半无限规划的支撑割平面算法。 短句来源 An algorithm is presented for finding a local optimal solution of the (CBP) by solving a series of convex programs and linear programs. 另外，在上层目标函数严格凸的条件下，通过对单层问题的最优解和下层对偶问题可行域极点之间关系的研究，将求解凸双层规划问题转化为求解有限个凸规划问题，设计了一个求解凸双层规划的全局优化算法。 短句来源 更多
 凸规划问题
 A New Inexact Interior Proximal Point Algorithm for Solving Convex Programs 求解凸规划问题的一种新的不精确内邻近点方法 短句来源 An algorithm is presented for finding a local optimal solution of the (CBP) by solving a series of convex programs and linear programs. 另外，在上层目标函数严格凸的条件下，通过对单层问题的最优解和下层对偶问题可行域极点之间关系的研究，将求解凸双层规划问题转化为求解有限个凸规划问题，设计了一个求解凸双层规划的全局优化算法。 短句来源

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

 convex programs
 Characterizations of optimality, without requiring the usual constraint qualification, are then given for abstract convex programs with constraints satisfying certain "mean value" and "uniformly decreasing" properties. In both of them the tools of nonsmooth analysis are extensively exploited; in particular we utilize some results concerning the differentiability of marginal functions and some stability results concerning the solutions of convex programs. Conjugate function theory is used to develop dual programs for nonseparable convex programs involving the square root function. Particular cases of linear and convex programs are also analyzed and some comments about a comparison of the obtained results with those existing in the literature are given. Self-duality has been investigated for the class of non-differentiable convex programs. 更多
 A supporting-cutting-plane algórithm for a class of linear semi-infinite programming problems are given inthis paper.It is based on the cutting-plane algorithm of Veinott for convex programs.This algorithm has the property of being able to generate a cut from any violated constraint.A convergence theorem is also given. 本文以 Veinott 的求解凸规划的割平面法为基础,给出了求解一类线性半无限规划的支撑割平面算法。算法通过产生能行集的支撑超平面来进行切割,以加快收敛速度,并且算法具有收敛性。 A supporting-cutting-plane algorithm for a class of linear semi-infinite programming problems are given inthis paper. It is based on the cutting-plane algorithm of Veinott for convex programs. This algorithm has the property of being able to generate a out from any violated constraint. A convergence theorem is also given. 本文以Veinott的求解凸规划的割平面法为基础,给出了求解一类线性半无限规划的支撑割平面算法。算法通过产生能行集的支撑超平面来进行切割,以加快收敛速度,并且算法具有收敛性。 In this paper, we give an extension of the convergence theorem of the linearized Topkis-Veinott algorithm and show that this algorithm has verygood convergence properties in the case of convex program. 本文使用了最优步长和Armijo步长在较弱的条件下证明了T—V算法的收敛性和在凸规划情形时的良好收敛性质。 << 更多相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关convex programs的内容 在知识搜索中查有关convex programs的内容 在数字搜索中查有关convex programs的内容 在概念知识元中查有关convex programs的内容 在学术趋势中查有关convex programs的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

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