Description: 文献1的仿真程序
solves the linear least squares problem with nonnegative variables =
using the newton s algorithm in [1].
[1] Portugal, Judice and Vicente, A comparison of block pivoting and
％ interior point algorithms for linear least squares problems with
％ nonnegative variables, Mathematics of Computation, 63(1994), pp. =
625-643-literature of a simulation program solves the linear least squares p roblem with nonnegative variables using the n = ewton's algorithm in [1]. [1] Portugal. Judice and Vicente. A comparison of block pivoting and interior% po int algorithms for linear least squares proble ms% with nonnegative variables, Mathematics of Computation, 63 (1994), pp. = 625-643 Platform: |
Size: 1684 |
Author:刘美 |
Hits:
Description: 文献1的仿真程序
solves the linear least squares problem with nonnegative variables =
using the newton s algorithm in [1].
[1] Portugal, Judice and Vicente, A comparison of block pivoting and
％ interior point algorithms for linear least squares problems with
％ nonnegative variables, Mathematics of Computation, 63(1994), pp. =
625-643-literature of a simulation program solves the linear least squares p roblem with nonnegative variables using the n = ewton's algorithm in [1]. [1] Portugal. Judice and Vicente. A comparison of block pivoting and interior% po int algorithms for linear least squares proble ms% with nonnegative variables, Mathematics of Computation, 63 (1994), pp. = 625-643 Platform: |
Size: 1024 |
Author:刘美 |
Hits:
Description: 该程序使用matlab开发的规划中的经典算法——基于对偶仿射理论的内点法，在工程中是很常用的-The program developed by the use of matlab classical planning algorithm- based on the theory of dual affine interior point method, in the projects is a very commonly used Platform: |
Size: 9216 |
Author:韩璐 |
Hits:
Description: 图像细化的方法有两种即边缘点删除和内点保留传统的基于边缘点删除的细化算法在细化过程中只对边缘点的可删除性进行判断并作相应处理由于受跟踪顺序及所考察邻域的影响容易产生骨架的非对称性基于内点保留的细化算法容易使所获得的骨架大于一个像素本文在分析上述两类细化算法的基础上综合运用上述两种细化方法提出一种新的行之有效的并行细化算法.-Image Thinning There are two ways to delete that edge points and inner points to retain the traditional delete edge points based on the thinning algorithm in the refinement process only to the edge points can be carried out to determine and delete accordingly deal with the order because of tracking and examined the impact of neighborhood prone to asymmetric skeleton reservation-based interior-point thinning algorithm easily get more than a skeleton pixels Based on the analysis of these two types of thinning algorithm based on the comprehensive use of the two refinement method presents a new parallel thinning algorithm effective. Platform: |
Size: 252928 |
Author:poon |
Hits:
Description: 一个基于QR分解的并行原-对偶内点算法，给予matlab，读入数据成为xml文件。
-QR decomposition based on parallel the original- dual interior point algorithm, given matlab, read into the data become a xml file. Platform: |
Size: 2048 |
Author:ylf |
Hits:
Description: 4连通内点定义区域的scan line seed fill algorithm-4-connected region interior-point definition of scan line seed fill algorithm Platform: |
Size: 1024 |
Author:章礼平 |
Hits:
Description: 该程序使用matlab开发的规划中的经典算法——基于对偶仿射理论的内点法，在工程中是很常用的-The program developed by the use of matlab classical planning algorithm - based on the theory of dual affine interior point method, in the projects is a very commonly used-该程序使用matlab开发的规划中的经典算法——基于对偶仿射理论的内点法，在工程中是很常用的-The program developed by the use of matlab classical planning algorithm- based on the theory of dual affine interior point method, in the projects is a very commonly used Platform: |
Size: 486400 |
Author:yonggui |
Hits:
Description: 一、 牛顿－拉夫逊法概要
首先对一般的牛顿－拉夫逊法作一简单说明。已知一个变量X的函数
（4－6）
解此方程式时，由适当的近似值X（0）出发，根据 （4－7）
反复进行计算，当X（n）满足适当的收敛判定条件时就是（4－6）式的根。这样的方法就是所谓的牛顿－拉夫逊法。
式（4－7）就是取第n次近似解X（n）在曲线 上的点 处的切线与X轴的交点作下一次X（n+1）值的方法。参考图4－2（a）。在这一方法中为了能收敛于真解，初值X（0）的选取及函数f（X）必须满足适当的条件，如图4－2（b）所示的那种情况就不能收敛或收敛到别的根上去。
这一方法还可以做下面的解释，设第n次迭代得到的解与真值之差，即 的误差为 时，则
（4-8）
把 在 附近对 用泰勒级数展开
（4-9）
上式略去 以下的项
（4-10）
的误差可近似由上式计算出来
图4-2
（4-11）
比较式（4-7）和（4-11），可以看出牛顿-拉夫逊法的修正量和 的误差的一次项相等。
用同样的方法考虑，给出对n个变量 -:Because of the importance and complexity of power system, better algorithm and programme language
is very important . An interior point method based on the perturbed Karush2Kuhn2Tucker (KKT) condition is pre2
sented in this paper , where the method and process for the optimal power flow is treated through the Matlab’s
symbolic math toolbox and Mfunction is also presented. Using the symbolic code , it can improve the adaptability
of the programme dramatically. The advantage is that , what we need to do is change the model expression. We
can make use of the symbolic programme to check our programme while we write the Mfunctions. Using the Mat2
lab , we find the optimal solutions and calculate quickly and efficiently. It has proposed the powerful and unique
functions of Matlab in the optimization and calculation for power system.
Key words :power system symbolic calculation optimal power flow interior point method Platform: |
Size: 9216 |
Author:范凯 |
Hits:
Description: 内点法是最优化算法中的一种算法，可以用它太实现对算法的计算-Interior point optimization algorithm is an algorithm that can use it too much to realize the computational Platform: |
Size: 1024 |
Author:陈燕灿 |
Hits:
Description: Arbel使用仿射比例演算法（affine scaling algorithm），發表一系列求解多目標規劃問題的內點演算法，例如以內點演算法為基礎，再加入交談式（interactive）的方法與決策者進行溝通，評估決策者的偏好（preference）等技巧。演算法可以在每一回合中，找到效用函數較高的有效解，最後漸漸逼近問題的最佳解。
內點演算法的好處是隨問題變大，演算時間相對之下比較不會大幅提高，所以內點演算法的求解所需時間對於問題的大小比較不敏感。本研究採納Arbel的想法，提出求解分式OES問題的內點演算法，希望藉由內點演算法的特性，能有效率地求解多目標分式規劃問題。
-Arbel using the Affine Scaling Algorithm (affine scaling algorithm), published a series of multi-objective programming problem to solve within a point algorithms, such as within the point-based algorithm, and then add interactive (interactive) methods and communication and decision makers to assess the preferences of decision makers (preference) and other techniques. Algorithm can in each round, the higher the utility function to find an effective solution, and finally approaching the optimal policy.
Interior point algorithm has the advantage with the bigger problem, calculations of time are less likely to significantly improve contrast, so the interior point algorithms, the time required for the size of the problem is less sensitive. This study adopted the idea of Arbel, proposed for solving the problem of the fractional point algorithms OES, hoping interior point algorithm characteristics, can efficiently solve multi-objective fractional programming problems.
Platform: |
Size: 8192 |
Author:shawncho |
Hits:
Description: 电力系统规划算法内点法进行计算潮流和机组分组-Power system planning algorithm interior point method to calculate trends and unit grouping Platform: |
Size: 9216 |
Author:tantao |
Hits:
Description: 内点发求最优潮流算法，不是工具箱编的，验证过，是正确的。-For optimal power flow interior point algorithm hair, not the toolbox compiled, verified, is correct. Platform: |
Size: 4096 |
Author:wenxiaoqiang |
Hits:
Description: 内点法的算法技术文章，千万不要错过，有其适合初学者学习-Interior Point Algorithm for technical articles, do not miss, there it is suitable for beginners to learn Platform: |
Size: 301056 |
Author:胡长晖 |
Hits:
Description: 程序用于求解电力系统最优潮流，采用原-对偶内点算法，并辅以文献，有利于对内点法的学习。-Procedures for solving optimal power flow, the use of primal- dual interior point algorithm, supplemented by literature, internal point of law in favor of learning. Platform: |
Size: 1055744 |
Author:刘佳 |
Hits:
Search - interior point algorithm