Active set method and gradient projection method are currently the main approaches for linearly constrained convex programming. Interior-point method is one of the most effective choices for linear programming. In the paper a predictor-corrector interior-point algorithm for linearly constrained convex programming under the predictor-corrector motivation was proposed. In each iteration, the algorithm first performs a predictor-step to reduce the duality gap and then a corrector-step to keep the points close to the central trajectory.Computations in the algorithm only require that the initial iterate be nonnegative while feasibility or strict feasibility is not required. It is proved that the algorithm is equivalent to a level-1 perturbed composite Newton method. Numerical experiments on twenty-six standard test problems are made. The results show that the proposed algorithm is stable and robust.