您要查找的是不是：
- An interior point cannot be an extreme point. 一个内点不可能是极点。
- An interior point method is used to solve the multi-objective OPF. 并用与系统规模关系不大的内点法对模型进行求解。
- Thirdly, the model of Optimal Power Flow (OPF) with UPFC is established, and solved by interior point method. 然后,建立了计及UPFC的最优潮流数学模型,并用内点法进行求解。
- However, the global astringency of the interior point method for nonconvex problems is doubtml theoretically. 但在理论上，内点法求解非凸优化问题时的全局收敛性能受到质疑。
- Lastly, the model of Transient Stability Constrained OPF (TSCOPF) with UPFC is established, and also solved by interior point method. 最后,建立了计及UPFC的暂态稳定约束最优潮流的模型,并用内点法进行求解。
- Based on improved genetic algorithm (IGA) and primal-dual interior point (PDIP) algorithm, a hybrid reactive power optimization algorithm is proposed. 基于改进遗传算法和原对偶内点法提出一种求解无功优化问题的混合算法。
- Hao Yuguo,Liu Guang yi,Yu Erkeng.A new OPF algorihm based on karmarkar's interior point method[J].Proceedings of the CSEE,1996,16(6):409-412. [1]郝玉国;刘广一;于尔铿.;一种基于Karmarkar内点法的最优潮流算法[J]
- Vectorization technique with step-controlled primal-dual interior point method improves the calculation speed and convergence performance of DOPF. 基于步长控制内点法的矢量化方法提高了DOPF程序的计算速度和收敛性。
- 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. 文摘:本文为框式约束的一类凸规划提出了一个新的内点算法，原始-对偶路径跟踪法，并证明了算法的迭代复杂性为多项式时间性.
- The interior point method is a polynomial time algorithm for solving linear programming problem, and its number of iterations is independent on the size of system. 内点法是一种求解线性规划问题的多项式时间算法,其显著特征是其迭代次数与系统规模关系不大。
- Named as SDP-OPF, the proposed method involves reformulating the OPF problem into a SDP model, which is a convex problem, and developing an interior point method (IPM) for SDP. 该方法将非凸OPF问题等价转换为半定规划问题，然后应用原始-对偶内点法求解。
- This paper presented a new method combining of neighbor search and interior point to solve unit commitment (UC) nondeterministic polynomial (NP)-hard problem. 定义邻域的结构，并提出一种邻域的调整方法，可处理各项约束条件，保证结果的可行性。
- The problem for getting K-T point of nonlinear pro gramming by combined homotopy interior point method under linearly independent c onstraint qualification is discussed at [1]. 文献[1]讨论了在线性无关的约束规定下，用组合同伦内点法求解非线性规划的K-T点问题。
- It converts the calculation of PoC to a nonlinear programming problem, which is solved by predictor corrector primal dual interior point method in this paper. 对直接求取电压崩溃临界点的零特征根法进行扩展，将临界点计算转化为非线性规划问题，并用预测校正原对偶内点法求解。
- We use it in the solution of the optimal power flow along with the Mult-SUMT, which is combined by interior point penalty function and exterior point penalty function. 该文介绍了一种新的演化优化算法，即粒子群算法（PSO）。
- WEI Hua,DING Xiao-ying.An algorithm for determining voltage stability critical point baaed on interior point theory[J].Proceedings of the CSEE,2002,22(3):27-31. [3]韦化;丁晓莺.;基于现代内点理论的电压稳定临界点算法[J]
- Recently, a combined homotopy interior point method (denoted as CHIP method for convenience) was presented to solve a class of nonlinear programming problems. 摘要最近学者们提出了组合同伦内点法（简记为CHIP方法）去求解一类非线性规划问题。
- Trade-unions began to appear, first along the seaboard, then at such interior points as Buffalo, Pittsburgh, Cincinnati and St. Louis. 工会渐渐出现，起初循沿海岸，然后在象布法罗、匹兹堡、辛辛那提和圣路易这些内地城市展开。
- The potentials and fluxes at the interior points close to the boundary are computed for three-dimensional beat conduction examples. 对三维热传导算例，计算了近边界点的温度和热流。
- This paper modifies the trust region interior point algorithm proposed by Coleman & Li for solving the optimization problem of a smooth nonlinear function subject to bounds on the variables. 改进了Coleman和Li提出信赖域内点算法解有界变量约束的优化问题.
