In order to overcome the deficiency that initial points should be strictly feasible in interior point methods, a primal-dual infeasible-interior-point algorithm for the second-order cone programming (SOCP) is presented.

• 摘要为了克服内点算法中初始点是严格可行的这一缺点，给出二次锥规划的一种原－对偶不可行内点算法。