Abstract: A primaldual inexact infeasibleinteriorpoint algorithm is presented for solving the secondorder cone programming problems. By means of introducing an infeasible neighborhood, the algorithm allows the use 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.

Key words: secondorder cone programming, infeasibleinteriorpoint algorithm, inexact search direction