primal dual algorithm 中文意思是什麼
primal dual algorithm
解釋
原有對偶演算法-
Establishing the formulation of conventional opf problem, and applying a perturbed - kkt - conditions - based primal - dual interior point algorithm ( p - kkt - pdip ) to solve it. 3
建立了常規opf的數學模型,並採用基於擾動kkt條件的原始?對偶內點演算法( p - kkt - pdip )對其進行解算; 3 -
An interior - point potential reduction algorithm is established to solve general nonlinear programming by a combination of the classical damped newton method and the primal - dual interior - point potential reduction method for linear programming
摘要結合經典阻尼牛頓方法和線性規劃內點勢減方法建立了一個求解一般非線性規劃問題的內點勢減演算法。 -
In order to improve the efficiency of the algorithm, we not only correct some defects of the primal - dual interior point algorithm in [ 4 ], but also give a modified primal - dual interior point algorithm for convex quadratic programming problem with box constraints
為提高演算法的有效性,對文[ 4 ]所給的原始-對偶內點演算法理論上的某些缺陷加以更正,並給出框式約束凸二次規劃問題的一個修正原始-對偶內點演算法。 -
Abstract : this paper presents a new primal ? dual interior point algorithm for a convex programming with box constraints, and prove the iteration complexity is polynomial
文摘:本文為框式約束的一類凸規劃提出了一個新的內點演算法,原始-對偶路徑跟蹤法,並證明了演算法的迭代復雜性為多項式時間性 -
Motivated by this fact and peng ' s promising result, we utilize a special algebraic transformation, namely logarithmic transformation, to establish a non - infeasible long - step primal - dual path following algorithm. this algorithm arrives at the primal - dual solution set along the steepest descent direction of primal - dual
第七章,通過構造一個新的鄰近度量函數,提出一個具有自調節功能的原一對偶路徑跟蹤內點演算法,並將其與線性規劃軟體lipsol和彭等人的m 。
分享友人