1) Karmarkar interior point algorithm
Karmarkar内点算法
2) Karmarkar algorithm
Karmarkar算法
1.
It is also shown that using Karmarkar algorithm to optimize the initial iteration point can make the linear approximation more effective.
采用Karmarkar算法优化初始迭代点 ,使线性逼近算法更为有
3) interior point algorithm
内点算法
1.
A primal-dual infeasible interior point algorithm for semidefinite programming was proposed.
对于半定规划问题,通过构造适当的搜索方向,给出了一个原始-对偶不可行内点算法。
2.
The interior point algorithm using similar mapping transformation is applied to reliabilityevaluation of power system.
提出基于仿射变换的内点算法求解大规模电力系统可靠性评估。
3.
A new interior point algorithm based on the general power transformation is developed.
分析了对线性互补问题的中心化方程xs=μe实施代数等价变换的作用,揭示出彭积明等人近期提出的自正则邻近度量方法相当于一种等价的幂变换,并在更一般的基础上,建立了一个基于幂变换的内点算法。
4) interior-point algorithm
内点算法
1.
An interior-point algorithm of changing ellipsoids radius for convex programming;
凸规划的一种变椭球半径的内点算法
2.
A high-order affine scaling interior-point algorithm for solving P_*(κ)-matrix linear complementarity problems;
求解P_*(κ)-阵线性互补问题的高阶仿射尺度内点算法
3.
Primal-dual predictor-corrector interior-point algorithm is presented to solve SDP problems in these fields.
为了更好地求解这些领域中遇到的半定规划问题,给出了半定规划的原始对偶预估校正内点算法。
5) interior point method
内点算法
1.
The proposed OPF problem with typical nonlinearity is solved by interior point method.
所提模型是一个典型的非线性规划模型,采用内点算法求解。
2.
Successive linear programming based on interior point method has been widely applied in the power system for its advantage of flexible disposal of the tolerances and not having to shape the Hessen matrix.
文中基于现代内点理论提出一种改进的信赖域内点算法。
3.
To improve the adaptability of OP F(Optimal Power Flow)algorithm,a symbolic interior point method based on the perturbed KKT condition is presented,which applies Matlab’s symbolic math too lbox.
为提高最优潮流算法的通用性,利用Matlab符号计算工具箱完成了一种基于扰动KKT条件的内点算法最优潮流的符号计算。
6) interior-point methods
内点算法
1.
This article mainly deals with some latest developments of interior-point methods in the past few years.
本文讨论的是近年来关于内点算法的一些最新的发展,主要由两部分构成。
2.
The classical method for the solution of linear programs is Dantzig s simplex algorithm and interior-point methods.
单纯形算法和内点算法是线性规划的经典算法,虽然线性规划单纯形算法在实际应用中是一种高效的方法,然而在理论上它并不是多项式算法,因而吸引了无数学者去试图设计线性规划的多项式算法。
3.
Nowadays,interior-point methods are widely used in nonliear optimization,combination optimization and complement optimization.
本文是用仿射尺度内点算法来解决带线性约束的优化问题,在算法中,定义信赖域子问题时,在每一个迭代点,不要求x_κ+s_κ严格在边界里边,只要求l≤x_κ+sκ≤u,当x_κ+s_κ在边界上时,通过因子σ_κ来缩小s_κ使得迭代点都在边界里边,而且σ_κ给出了具体的计算方法。
补充资料：内点
若z0及其邻域均属于点集e，则称z0为该点集的内点。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条