A primal-dual inexact infeasible interior-point algorithm for the second-order cone program (SOCP) was presented.

A primal-dual inexact infeasible interior-point algorithm for the second-order cone program (SOCP) was presented.

摘要给出了二次锥规划的一种非精确不可行内点算法。