助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   对偶算法 的翻译结果: 查询用时:1.31秒
图标索引 在分类学科中查询
所有学科
数学
互联网技术
铁路运输
交通运输经济
建筑科学与工程
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

对偶算法     
相关语句
  dual algorithm
     A DUAL ALGORITHM FOR SOLVING CONSTRAINED OPTIMIZATION PROBLEMS
     求解约束优化问题的一个对偶算法
短句来源
     Internet adaptive congestion control primal dual algorithm
     互联网的自适应拥塞控制主对偶算法
     A New Dual Algorithm for the Transportation Problem
     一种新的运输问题对偶算法
短句来源
     Secondly, a dual algorithm, i.e., a nonlinear Lagrange algorithm, based on the modified Lagrange function is proposed.
     基于该修正Lagrange函数给出了一个对偶算法,即非线性Lagrange算法。
短句来源
     Author has applied the fuzzy value set theory,used α-cuts as conception,studied the dual form of the fuzzy positive geometric propramming (FPGP),and proved the dual theorem and optimal solution existy on the basic on [1] in this paper,so that the dual algorithm is given in the FPGP.
     应用Fuzzy值集的理论和α-截集的概念,在[1]的基础上,研究了Fuzzy正项几何规划的对偶形式,证明了对偶定理和最优解的存在定理,导出了Fuzzy正项几何规划的对偶算法
短句来源
更多       
  dual algorithms
     A Class of Constructive Dual Algorithms for Solving Nonlinear Programming Problems
     求解非线性规划问题的一类对偶算法(英文)
短句来源
     This dissertation studies mainly theories and according numerical implementation of a class of dual algorithms for nonlinear optimization problems, including unconstrained minimax problems and constrained nonlinear programming problems.
     本文主要研究非线性优化中的一类对偶算法,包括无约束极大极小问题的对偶算法和约束非线性规划问题的一类对偶算法的理论与相应的数值实现。
短句来源
     4. Chapter 5 reports numerical experiments for the dual algorithms in Chapter 2, Chapter 3 and Chapter 4. We apply these dual algorithms to solve a large number of nonlinear optimization problems with relative small scale, including inequality constrained optimization problems, unconstrained minimax problems and general constrained optimization problems.
     4.第5章对第2章,第3章及第4章的对偶算法进行了数值实验。 用这些算法计算大量的规模不是很大的不等式约束优化问题,无约束极大
短句来源
     We analyse the dual algorithms for positive definite and certain semi—positive definite quadratic programming and indicate that these algorithms can be derived from the Lagrangian methods.
     我们分析了解正定二次规划和某些半正定二次规划的对偶算法,指出这些算法可以从Lagrange方法直接导出。
短句来源
     We analyse the dual algorithms for positive dofinite and certain semi-positive definite quadratic programming and in- dicate that these algorithms can be derived from the Lagrangian methods.
     我们分析了解正定二次规划和某些半正定二次规划的对偶算法,指出这些算法可以从 Lagrange 方法直接导出。
短句来源
更多       
  extended dual algorithm
     Then the effectivity of the method is illustrated by using to solve the general constrained optimization problems and the multi-objective problem . Furthermore ,an extended dual algorithm is described. Finally,numerical results are given and analyzed.
     1.对熵函数法作了进一步的研究,对改进的熵函数法作了较深入的理论分析,给出了误差估计,并将其用于解一般的约束问题、多目标规划问题,在此基础上又构造了一种新的对偶算法,并给出数值实验和收敛性证明.
短句来源
  simplex algorithm
     A MODIFIED DUAL SIMPLEX ALGORITHM FOR L. P. WITH BOUNDED VARIABLES
     变量有上界线性规划问题的对偶算法
短句来源
     A Dual Simplex Algorithm for Solving Linear Goal programming with Bounded Variables
     变量有界线性目标规划的对偶算法
短句来源
     This paper discussed the problem of linear goal programming with bounded vari-ables and gave a dual simplex algorithm for soluing this kind of problem. The algorithmis analogous to the dual simplex algorithm for linear programming with bounded vari-ables.
     本文讨论了变量有界的线性目标规划问题,给出了求解这类问题的一个对偶算法,此方法与变量有界线性规划问题的对偶算法相类似。
短句来源

 

查询“对偶算法”译词为其他词的双语例句

     

    查询“对偶算法”译词为用户自定义的双语例句

        我想查看译文中含有:的双语例句
    例句
    为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
      dual algorithm
    The dual algorithm for minimax problems is further studied in this paper.
          
    An iterative regularization of the dual algorithm is considered.
          
    An iterative regularization of the dual algorithm is considered.
          
    Compared to the modified-simplex type methods, the presented dual algorithm QPLS requires less storage and solves ill-conditioned problems more precisely.
          
    Improved dual algorithm for constrained optimization problems
          
    更多          
      dual algorithms
    We prove correctness of the primal and dual algorithms for full first-order logic with functions, as well as termination on unsatisfiable formulas.
          
    This is a general framework, that enables us to analyze various long-step primal-dual algorithms in the literature in a short and uniform way.
          
    The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
          
    It is shown that the class of dual algorithms which solve this problem consists of different variants of a common general algorithm.
          
    Constant potential primal-dual algorithms: A framework
          
    更多          
      simplex algorithm
    By taking the advantages of a special structure of the lot-sizing problem, the local search can be implemented by using a modified simplex algorithm, which significantly reduces its computation time.
          
    The method builds the transform between RGB space and CIELAB space directly using the downhill simplex algorithm.
          
    Optimum values of the parameters of overloaded elution are derived for maximum production rate, using a Simplex algorithm and the procedure previously described for the simulation of the elution profiles of binary mixtures.
          
    This study reports on the optimization of LC separation of coumarins using a variable-size simplex algorithm.
          
    The retention ratio factors k for coumarins at the optimum of the simplex algorithm lay in the range 1?>amp;lt;?k?>amp;lt;?4.
          
    更多          


    In this paper the procedure of computation for the solution of transportation problems by primal-dual algorithm is discussed. Its advantage lies in considerable reduction of the amount of computational work by as much as 50% as compared with the conventional algorithm used in solving the such problems. A program written in "719" algorithmic language and its explanation is presented in this paper. A technique for remembering the number of positive variables and their positions is adopted in the program, thereby...

    In this paper the procedure of computation for the solution of transportation problems by primal-dual algorithm is discussed. Its advantage lies in considerable reduction of the amount of computational work by as much as 50% as compared with the conventional algorithm used in solving the such problems. A program written in "719" algorithmic language and its explanation is presented in this paper. A technique for remembering the number of positive variables and their positions is adopted in the program, thereby a great deal of running time is saved. On "719" digital computer, it takes about 15 seconds to solve a transportation problem with approximately one hundred variables including time for printing the answer. For this type of computer over 6000 variables can be admitted. If a program of the simplex algorithm were adopted, it would take more than 2 minutes to solve the same problem, and onlya few hundred variables could be admitted. In case of problems with thousands of variables, the primal-dual algorithm will be far more efficient.

    本文讨论用原始对偶算法解运输问题的计算步骤。其比点是计算工作量小,与一般解运输问题的算法相比约少50%。文中列出用“719”算法语言编写的程序及其说明。程序采用存储正变量的个数和它们的位置的方法,因此大大缩短了运算时间。在“719”电子计算机上,求解大约有100个变量的运输问題,包括打印计算结果的时间在内,约需15秒钟;机上允许出现的变量可达6000个以上。如果采用单纯形算法程序,则解同样的问题所需要的时间将超过2分钟;允许出现的变量也只有几百个。对于有大量变量的问題,原始对偶算法将更为有效。

    This paper develoPs the concepts of a pair of trees and their distance in a linear graph. The necessary and sufficient conditions for a maximally and minimally di'stant tree pair and the algorithms for finding a maximally and minimally distant tree pair are given. This paper also disccuses the applications of maximally and minimally distant tree pairs in equal parameter graphs in the electrical network analysis, and Presents the dual algorithm of Principal partition algithm 1 and the algrithm of oPtimal harmonious...

    This paper develoPs the concepts of a pair of trees and their distance in a linear graph. The necessary and sufficient conditions for a maximally and minimally di'stant tree pair and the algorithms for finding a maximally and minimally distant tree pair are given. This paper also disccuses the applications of maximally and minimally distant tree pairs in equal parameter graphs in the electrical network analysis, and Presents the dual algorithm of Principal partition algithm 1 and the algrithm of oPtimal harmonious decomposition of electrical networks.

    本文推广了线图的树对及其距离的概念,提出了等参数图及其树对和树对之距离的概念。给出了等参数图中任一树对为一最大(或最小)距离树对的充分必要条件和相应的算法,讨论了等参数图中最大与最小距离树对在电网络分析中的应用,给出了网络图主划分算法1的对偶算法和电网络的最优调和分解算法。

    In this paper we are interested in the Lagrangian methods for solving quadratic programming problem. We analyse the dual algorithms for positive definite and certain semi—positive definite quadratic programming and indicate that these algorithms can be derived from the Lagrangian methods. Besides, we present a new algorithm in which, when the projective matrix is indefinite, we can solve a Lagrange equation by using generalized Cholesky factorization to get the negative curvature direction of the Objective function....

    In this paper we are interested in the Lagrangian methods for solving quadratic programming problem. We analyse the dual algorithms for positive definite and certain semi—positive definite quadratic programming and indicate that these algorithms can be derived from the Lagrangian methods. Besides, we present a new algorithm in which, when the projective matrix is indefinite, we can solve a Lagrange equation by using generalized Cholesky factorization to get the negative curvature direction of the Objective function. The active set strategy is also adopted in the algorithm.

    本文讨论解二次规划问题的Lagrange方法。我们分析了解正定二次规划和某些半正定二次规划的对偶算法,指出这些算法可以从Lagrange方法直接导出。此外我们还给出了解不定二次规划的一个新的Lagrange算法。这一算法在投影矩阵为不定矩阵时,利用广义的Cholesky分解技术由Lagrange方程解得二次目标函数的负曲率方向,以此作为该步迭代寻查方向。算法还采用了有效集策略。

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

     


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

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