primal algorithm 中文意思是什麼
primal 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 -
This paper presents a new interior point nonlinear programming algorithm for optimal power flow problems ( opf ) based on the perturbed kkt conditions of the primal problem with a novel data structure
基於原問題的擾動kkt條件，本文提出了一種帶新數據結構的原始對偶內點演算法求解電力系統最優潮流問題。 -
Besides, of the several algorithms those have been proposed in the literature for solving the transportation problem, previous computational results indicated that the primal algorithm ( modi method ) is more efficient, so we have compared the amedv versus the modi method. because very little experimentation was carried out on algorithmic techniques used in the codes of amedv, we have also performed a number of runs that test the overall solution time as the number of significant digits in each of the parameters is varied
因為元素判別值分配法是運輸問題引發出的求解新方法，並且階石法是目前解運輸問題的較快速解法，所以特別針對運輸問題通過若干組有代表性的檢驗數據進行數值測試，在實際問題中對比元素判別值分配法與階石法的演算法執行時間，研究兩對演算法執行效率上的差別，並分析差別產生的原因。 -
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 ]所給的原始-對偶內點演算法理論上的某些缺陷加以更正，並給出框式約束凸二次規劃問題的一個修正原始-對偶內點演算法。 -
On the basis of the perturbed karush - kuhn - tucker ( kkt ) conditions of the primal problem, this paper presents a new interior point algorithm to solve power system weighted nonlinear l ( norm ( ipwnl1 ) state and parameter estimation problem
基於原問題的擾動karush - kuhn - tucker （ kkt ）條件，本文提出了一種新的電力系統加權非線性l1范數狀態及參數估計內點演算法。 -
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 。 -
This paper presents a bidding model of power market and resolves it by a new interior point nonlinear programming algorithm for optimal power flow problems ( opf ) based on the perturbed kkt conditions of the primal problem. at the same time, it discusses the implementation of a bidding system based on web
本文基於原問題擾動karush - kuhn - tucker （ kkt ）條件的現代內點最優化演算法，完成了電力市場競價模型的建立和求解，並初步討論了一種基於web的競價交易系統之實現。
分享友人