In this talk, we propose a nonlinear Lagrange method for nonlinear second-order cone programming problem based on a Löwner operator associated a potential function of the optimization problems with inequality constrains . The properties of both the Löwner operator and the nonlinear Lagrangian is discussed. The convergence properties of the nonlinear Lagrange method are discussed when subproblems are assumed to be solved exactly and inexactly, respectively, under some mild assumptions. The convergence results show that the sequence of points generated by the proposed method is locally convergent when the penalty parameter is less than a threshold , and the error bound of solution is proportional to the penalty parameter.