对于有大量变量的问题，原始对偶算法将更为有效。
In case of problems with thousands of variables, the primal-dual algorithm will be far more efficient.
第3章给出无约束极大极小问题的一个对偶算法的收敛理论。
Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems.
针对目标函数具有递增斜率的分段线性规划问题，提出了一种快速的对偶算法。
A fast dual algorithm is presented for the piecewise linear programming with successively increasing slopes.
本文通过对线性规划问题中的核心矩阵的分析，提出了一种基于核心矩阵的原始对偶算法。
This paper analyzes the kernel matrix in the linear programming problem and proposes a new revised prime-dual algorithm based on the kernel matrix.
本文对运输问题的原设-对偶算法运用推拉流思想进行改进，得到一个拟多项式时间算法。
Based on the N-person cooperative game theory, this paper puts forward a model of the minimum cost allocation of transportation problem.
通过论证用一般线性规划的对偶算法求解本模型的可行性，使得该模型的求解问题迎刃而解。
After demonstrating the feasibility of using the dual algorithm for general linear programming to solve this model, we get an effective algorithm.
包括启发式路径搜索算法、基于原始-对偶算法的最优路径选择算法、信道分配调整算法等三个部分。
This algorithm consists of heuristic-based search algorithm, primal-dual-based optimal path selection algorithm and channel assignment adjustment algorithm.
集合覆盖问题的各种变体以及其对偶问题的随机算法研究。
Randomized algorithms for the set cover problem and its variations and duals.
摘要本文对线性规划提出了一个不可行内点原始-对偶仿射尺度算法，并证明了算法是一个多项式时间算法。
This paper presents a infeasible interior-point primal -dual affine scaling algorithm for linear programming. it is shown that the method is polynomial-time algorithm.
运用求解线性规划对偶单纯形算法原理，进一步研究迭代过程中目标函数的变化。
Based on the principle of the dual simplex method about linear programming, the changes of the value of the objective function in iterations have been studied.
采用椭球剖分策略剖分可行域为小的椭球，用投影次梯度算法解松弛二次规划问题的拉格朗日对偶问题，从而获得原问题的一个下界。
A projection subgradient algorithm for the Lagrangian dual problem of the relaxed quadratic problem is employed to general lower bounds of the optimal value for the original problem.
与原对偶单纯形法相比，改进算法的存贮量和计算量大大减少。
Compared with the dual simplex method, the amount of the storage and calculations of the improved algorithm is largely reduced.
首先介绍了原-对偶内点算法的主要计算步骤，阐明哪一步上可以进行并行化处理。
This paper first describes the steps involved in primal-dual interior point algorithm and explains which step in it can be parallelized.
对高精度导航系统和大机动场景来说，对偶四元数算法是一个更好的选择。
The new algorithm turns out to be a better choice than the conventional algorithm for high-precision navigation systems and high-maneuver applications.
然后，运用凸优化技术分析了该资源分配问题，并基于拉格朗日对偶法给出了一种子载波和功率最优分配算法。
Then, by use of multiple carrier system's frequency-sharing property and convex optimization, a subcarrier and power optimal allocation algorithm is proposed based on Lagrangian duality theory.
新算法主要特点是形态运算采用非对偶运算，对比度拉伸运算采用加法代替乘法运算。
In this algorithm, the morphological operations are non-dual and the contrast stretching operations are addition instead of multiplication.
论文将对偶四元数法应用到三维物体识别的匹配算法中，利用最小二乘的思想提出了一种基于迭代最近点的匹配算法。
Last, we apply the dual quaternion algorithm to matching algorithm of 3d object recognition and make use of least-squares technique to propose a matching method based on iterative closest point.
为了克服这些困难，提出了一种基于序列二次近似算法精确的对偶映射。
In order to overcome the difficulties, a sequential quadratic approximate algorithm is proposed based on exact dual mapping.
从算法流程图和序码分析两个方面进行外部调序，用码位倒置和对偶演化相结合进行内部调序。
By means of the dual evolution, the external and internal ordering technique for the Walsh transform (FWT) was introduced and four kinds of ordering analyzed respectively.
该参数优化算法可在对偶松弛凸可分规划算法的主循环之外，通过少量参数化扩展得到。
Based on dual relaxation method to extend a special convex separable programming algorithm, this tracking algorithm was constructed by parametric analysis.
本文在子空间分类器的基础上，对子空间的概念进行了扩展，提出了对偶子空间的概念和相应的分类算法。
On the basis of subspace classifier the concept of subspace is developed and a new concept called dual subspace and corresponding algorithm of classification are presented in this paper.
分析指出弧标号、节点标号算法在算法原理上是一致的，对偶网络法是对它们的直观化。
Further analysis shows that arc labeling and node labeling algorithms have no difference in fundamentals, while the dual network method is their visualized version.
本算法从一个对偶森林向另一个对偶森林迭代。
This paper presents a dual forest iteration algorithm for solving stochastic transportation problems.
借鉴成熟的姿态四元数积分的双速算法结构，设计了一个数值积分算法求解以上三个运动学方程，构建了基于对偶四元数的捷联惯性导航算法。
Borrowing the traditional two-speed approach originally developed in conventional attitude integration, we design one new numerical integration algorithm to solve the three kinematic equations.
借鉴成熟的姿态四元数积分的双速算法结构，设计了一个数值积分算法求解以上三个运动学方程，构建了基于对偶四元数的捷联惯性导航算法。
Borrowing the traditional two-speed approach originally developed in conventional attitude integration, we design one new numerical integration algorithm to solve the three kinematic equations.
应用推荐