An SQP-type algorithm for nonlinear second-order cone programs

We propose an SQP-type algorithm for solving nonlinear second-order cone programming (NSOCP) problems. At every iteration, the algorithm solves a convex SOCP subproblem in which the constraints involve linear approximations of the constraint functions in the original problem and the objective function is a convex quadratic function. Those subproblems can be transformed into linear SOCP problems, for which efficient interior point solvers are available. We establish global convergence and local quadratic convergence of the algorithm under appropriate assumptions. We report numerical results to examine the effectiveness of the algorithm. Key Words Nonlinear second-order cone programming problem, SQP method, global convergence, quadratic convergence

• Type: Journal
• Year: 2007
• Where: OL
• Authors: Hirokazu Kato, Masao Fukushima
• Keywords: Algorithm, Nonlinear Second-order Cone, OL 2007, Quadratic Convergence