Abstract
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.
Similar content being viewed by others
References
Alizadeh F., Goldfarb D.(2003). Second-order cone programming. Math. Program. 95, 3–51
Ben-Tal A., Nemirovski A.(1998). Robust convex optimization. Math. Oper. Res. 23, 769–805
Boggs P.T., Tolle J.W.(1995). Sequential quadratic programming. Acta Numer. 4, 1–51
Bonnans J.F., Ramírez H.(2005). Perturbation analysis of second-order-cone programming problems. Math. Program. 104, 205–227
Bonnans J.F., Shapiro A.(2000). Perturbation Analysis of Optimization Problems. Springer, Berlin Heidelberg New York
Correa R., Ramírez H. (2004). A global algorithm for nonlinear semidefinite programming. SIAM J. Optim. 15,303–318
Han S.P.(1977). A globally convergent method for nonlinear programming. J. Optim. Theory Appl. 22, 297–309
Kanzow C., Nagel C., Kato H., Fukushima M.(2005). Successive linearization methods for nonlinear semidefinite programs. Comput. Optim. Appl. 31, 251–273
Lobo M.S., Vandenberghe L., Boyd S., Lebret H.(1998). Applications of second-order cone programming. Linear Algebra Appl 284, 193–228
Monteiro R.D.C., Tsuchiya T.(2000). Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. Math. Program. 88, 61–83
Robinson, S.M.: Generalized equations. In: Bachem, A., et al. (eds.) Mathematical Programming: The State of the Art, pp. 346–367. Springer, Berlin Heidelberg New York (1983)
Todd M.J.(2001). Semidefinite optimization. Acta Numer. 10, 515–560
Tütüncü R.H., Toh K.C., Todd M.J.(2003). Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95, 189–217
Vandenberghe L., Boyd S.(1996). Semidefinite programming. SIAM Rev. 38, 49–95
Vanderbei R.J., Shanno D.F.(1999). An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13, 231–252
Yamashita H., Yabe H.(2003). An interior point method with a primal-dual quadratic barrier penalty function for nonlinear optimization. SIAM J. Optim. 14, 479–499
Yamashita, H., Yabe, H.: A primal-dual interior point method for nonlinear optimization over second order cones. Technical Report, Mathematical Systems Inc., Tokyo (2005) (revised February 2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported in part by the Scientific Research Grant-in-Aid from Japan Society for the Promotion of Science.
Rights and permissions
About this article
Cite this article
Kato, H., Fukushima, M. An SQP-type algorithm for nonlinear second-order cone programs. Optimization Letters 1, 129–144 (2007). https://doi.org/10.1007/s11590-006-0009-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-006-0009-2