助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   outer approximation 的翻译结果: 查询用时:0.218秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

outer approximation
相关语句
  外逼近
     The upper bounds are computed with the outer approximation method where Lagrangian relaxations are solved with the maximum-flow algorithm.
     用外逼近法求拉格朗日对偶问题得到上界,其中拉格朗日松弛问题通过转化为一个网络最大流问题来求解.
短句来源
     Some Convergence Results for an Outer Approximation Method for Variational Inequalities
     求解变分不等式的一种外逼近法的若干收敛性结果
短句来源
     We give the global optimality conditions of biconcave programming programming problem and structure a outer approximation algorithm for solving the biconcave programming problem with separable linear constraints.
     我们给出了双凹规划问题的整体最优性条件 ,并构造了一个有限终止外逼近算法 .
短句来源
     We compare the proposed convexification method with Tuy's Ployblock outer approximation method. The illustrative example shows clearly that the convexification method is superior to the Tuy's method in solving the monotone problem.
     我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较,通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法.
短句来源
     The paper presents a branch and reduce approach for solving nonconvex quadratic programming problems with quadratic constraints, which organically combines outer approximation method with branch and bound scheme.
     在这篇论文里,有机地把外逼近方法与分枝定界技术结合起来,提出了解带有二次约束非凸二次规划问题的一个分枝缩减方法;
短句来源
更多       
  外逼近方法
     An Outer Approximation Method for Solving the Biconcave Programs with Separable Linear Constraints
     解可分离约束双凹规划问题的一种外逼近方法(英文)
短句来源
     This paper intends to present an outer approximation method based on a "visibility" assumption borrowed from location theory,called the optimal visible point algorithm,so that the global optimal solution of the original problem is achieved,and the convergence of the algorithm is analysed.
     基于借用定位理论中的“可视性 (visibility)”假设 ,我们提出了求解非标准DC问题的一种外逼近方法 ,称之为最优可视点算法 ,从而获得问题的全局最优解 ,并证明了算法的收敛性 . 该方法当非凸变量的数目较少时是有效的、实用的 .
短句来源
     This paper proposes a new convexification transformation method to convert a monotone function into a convex function. The monotone optimization problem can then be converted to an equivalent convex maximization or concave minimization problem. Thus we can adopt the Hoffman's outer approximation method to find the global optimal solution.
     本文提出一种新的凸化变换方法把单调函数化为凸函数,进而把单调优化问题化为等价的凸极大或凹极小问题,然后采用Hoffman的外逼近方法来求得问题的全局最优解.
短句来源
     We compare the proposed convexification method with Tuy's Ployblock outer approximation method. The illustrative example shows clearly that the convexification method is superior to the Tuy's method in solving the monotone problem.
     我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较,通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法.
短句来源
     The paper presents a branch and reduce approach for solving nonconvex quadratic programming problems with quadratic constraints, which organically combines outer approximation method with branch and bound scheme.
     在这篇论文里,有机地把外逼近方法与分枝定界技术结合起来,提出了解带有二次约束非凸二次规划问题的一个分枝缩减方法;
短句来源
  “outer approximation”译为未确定词的双语例句
     An Interactive Outer Approximation Algorithm Based on Satisfactoriness to Solve Bilevel Multiobjective Decision Making Problem
     基于满意度的两层多目标决策问题的交互式外部逼近算法
短句来源
     In this paper,a new outer approximation algorithm for solving general convexprograms with GLP Gradient Projection method is provided,and the convergence under properconditions is proved.
     结合GLP投影梯度法,提出一种解一般凸规划问题的外点迈近算法,在适当条件下证明了收敛性定理。
短句来源
     Using the penalty function method, convex two-level programming can be transformed a concave programming with convex restricted set, and then, overall optimum solu- tion will be obtained by the outer approximation algorithm.
     用罚函数法将二层凸规划问题化为约束区域为凸集的凹规划,然后用渐进外逼算法求其全局最优解.
短句来源
     Compared with the solutions solved from OA(Outer Approximation),ECP(Extended Cutting Plane) and MIN-MIN methods,the ECGA algorithm is proved to be effective in finding the global optimal solution of three levels pump configuration via using the problem-specific information.
     通过与传统OA、ECP、M IN-M IN等算法解算结果比较,验证了ECGA算法可有效地求解三级泵配置问题.
短句来源
     The algorithm employed ellipsoidal outer approximation of the feasible set assuming instantaneous process and observation noise vectors and the initial state to be bounded by known ellipsoids.
     算法假设系统的过程和量测噪声以及初始状态由已知椭球来定界,然后利用椭球集合来描述系统真实状态的可行集.
短句来源
查询“outer approximation”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  outer approximation
In this paper, three promising approaches (Cone-Splitting, Polyhedral Annexation and Outer Approximation) are considerably modified in order to enhance efficiency.
      
The first one is a recent algorithm built on a new concept of equilibrium point and a modified version of the outer approximation method.
      
We deal with the advantages accrued when outer approximation, cutting plane, or branch-and-bound methods are used for solving these subproblems.
      
The approach introduces a new polyhedral partition and combines branch-and-bound techniques, outer approximation, and projection of polytopes in a suitable way.
      
These methods range from adaptive uniform discretization methods to outer approximation methods.
      
更多          


Approaches for designning a controller which satisfies all the requirements as stability, transient response and disturbance sensitivity is given in this paper via infinite programming. In the first part, several algorithms such as "outer approximation" and "cut map" are introduced for finding the feasible solution of mathematical programming under functional constraints. The second part devoted to design linear deterministic systems, linear adaptive(with time-varying parameters)systems and nonlinear systems....

Approaches for designning a controller which satisfies all the requirements as stability, transient response and disturbance sensitivity is given in this paper via infinite programming. In the first part, several algorithms such as "outer approximation" and "cut map" are introduced for finding the feasible solution of mathematical programming under functional constraints. The second part devoted to design linear deterministic systems, linear adaptive(with time-varying parameters)systems and nonlinear systems.

本文介绍一类有巨大应用潜力的控制系统设计方法。它把控制器参数的选择作为一个通过无限维数学规划搜索可行解的问题来处理。文中讨论了算法,并结合多种典型的控制系统的设计任务,提出了相应的解决方式。

In this paper the geometric properties of the difference periodic solutions of ordinary differential equations are discussed. The relation between the explicit difference solution and the implicit one is established.A correction difference solution with higher accuracy is constructed by the use of asymptotic expansion.Then it is proved that the difference periodic orbit preserves the convexity of periodic orbit.Finally a new technique is developed to study one-side approximation of numerical solutions...

In this paper the geometric properties of the difference periodic solutions of ordinary differential equations are discussed. The relation between the explicit difference solution and the implicit one is established.A correction difference solution with higher accuracy is constructed by the use of asymptotic expansion.Then it is proved that the difference periodic orbit preserves the convexity of periodic orbit.Finally a new technique is developed to study one-side approximation of numerical solutions and the condition of inner(or outer)approximation is also given.

本文讨论常微分方程差分周期解的几何性质。首先讨论了隐差分解与显差分解的关系,并利用差分解的渐近展开式构造差分校正解来提高精度。然后证明了差分周期解的凸性不变性。最后提出周期解单侧逼近的判别方法,得出了差分周期解单侧逼近的条件。

In this paper, we first set up a mathematical model of two-level multiobjective decision making proble with several decision makers interconnected based on Stackelberg leader-follower game. With the help of reference values of objective and Kuhn-Tucker conditon, we change the two-level multiobjective programming problem into a singular-level, singular objective, nonconvex constraint global optimization problem to which the convergent outer approximation method gives the global optimal solution afterwards....

In this paper, we first set up a mathematical model of two-level multiobjective decision making proble with several decision makers interconnected based on Stackelberg leader-follower game. With the help of reference values of objective and Kuhn-Tucker conditon, we change the two-level multiobjective programming problem into a singular-level, singular objective, nonconvex constraint global optimization problem to which the convergent outer approximation method gives the global optimal solution afterwards. And then, the analyst and the decision makers interact in virtue of the resulting trade-off rate to achieve the preferred solution to the two-level decision making problem.

本文首先建立了基于Stackelberg主从策略的多人有关联的两层多目标决策问题的数字模型,利用目标的参考值和Kuhn-Tucker条件把两层多目标规划问题转化为非凸约束全局优化问题,并采用收敛外部逼近法求解此非凸约束全局优化问题的全局最优解,然后利用所求得的置换率进行分析人与决策人之间的交互,最终获得两层决策问题的满意解。

 
<< 更多相关文摘    
图标索引 相关查询

 


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

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社