Abstract: A predictor-corrector interior-point algorithm for second-order cone programming is proposed.The duality gap has a large reduction by enlarging the neighborhood of the central path twice in the predictor step.A modified Newton direction is applied in the corrector step,which makes the method not only replace the iterative points in a smaller neighborhood but also reduce the duality gap by a constant.It is proved that the ε-approximate solution can be obtained in O(nln(xT0s0/ε)) iterations.