.png){kind=icon}
返回
An efficient interior point method for sequential quadratic programming based optimal power flow
.png){kind=icon}
PRE
AI
DOI：10.1109/59.898087.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new sequential quadratic programming algorithm for solving the optimal power flow problem. The algorithm is structured with an outer linearization loop and an inner optimization loop. The inner loop solves a relaxed reduced quadratic programming problem. Because constraint relaxation keeps the inner loop problem of small dimension, the algorithm is quite efficient. Its outer loop iteration counts are comparable to Newton power flow, and the inner loops are efficient interior point iterations. Several IEEE test systems were run. The results indicate that both outer and inner loop iteration counts do not vary greatly with problem size.
Keyword:
interior-point methods
nonlinear programming
optimal power flow
sequential quadratic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
Dynamical Cluster Approximation in Disordered Systems with Magnetic Impurities具有磁性杂质的无序系统中的动力学簇近似
PREAI
分享收藏
An interior-point method for nonlinear optimal power flow using voltage rectangular coordinates基于电压直角坐标的非线性最优潮流内点法
PREAI
分享收藏
Relative sparing of item recognition memory in a patient with adult‐onset damage limited to the hippocampus.png)
Hippocampus
HippocampusIF0
PREAI
分享收藏 没有更多内容
没有更多内容