A sensitivity result for quadratic second-order cone programming and its application

In this paper, we present a sensitivity result for quadratic second-order cone programming under the weak form of second-order sufficient condition. Based on this result, we analyze the local convergence of an SQP-type method for nonlinear second-order cone programming. The subproblems of this method at each iteration are quadratic second-order cone programming problems. Compared with the local convergence analysis done before, we do not need the assumption that the Hessian matrix of the Lagrangian function is positive definite. Besides, the iteration sequence which is proved to be superlinearly convergent does not contain the Lagrangian multiplier.