给出一种求解二次锥规划问题的原.对偶非精确不可行内点算法.通过引入一个不可行邻域,所给算法可以运用非精确搜索方向且不要求迭代点位于严格可行解集内.该算法是全局收敛的.
A primal-dual inexact infeasible-interior-point algorithm is presented for solving the second-order of inexact search directions and does not require iteration points to be within the sets of strictly feasible solutions. Then the proposed algorithm is shown to be global convergent.