A Sensitivity Result for Quadratic Second-Order Cone Programming and its Application

Qi Zhao1, Wenhao Fu2, Zhongwen Chen2
1Jiangsu University of Science and Technology, Zhenjiang, P.R. China
2School of Mathematical Sciences, Soochow University, Suzhou, P. R. China

Tóm tắt

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.

Từ khóa


Tài liệu tham khảo

F. Alizadeh, D. Goldfarb: Second-order cone programming. Math. Program. 95 (2003), 3–51. J. F. Bonnans, C. H. Ramírez: Perturbation analysis of second-order cone programming problems. Math. Program. 104 (2005), 205–207. J. F. Bonnans, A. Shapiro: Perturbation Analysis of Optimization Problems. Springer Series in Operations Research. Springer, New York, 2000. R. W. Freund, F. Jarre, C. H. Vogelbusch: Nonlinear semidefinite programming: Sensitivity, convergence, and an application in passive reduced-order modeling. Math. Program. 109 (2007), 581–611. E. H. Fukuda, M. Fukushima: The use of squared slack variables in nonlinear second-order cone programming. J. Optim. Theory Appl. 170 (2016), 394–418. E. H. Fukuda, P. J. S. Silva, M. Fukushima: Differentiable exact penalty functions for nonlinear second-order cone programs. SIAM J. Optim. 22 (2012), 1607–1633. R. Garcés, W. Gómez, F. Jarre: A sensitivity result for quadratic semidefinite programs with an application to a sequential quadratic semidefinite programming algorithm. Comput. Appl. Math. 31 (2012), 205–218. C. Kanzow, I. Ferenczi, M. Fukushima: On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity. SIAM J. Optim. 20 (2009), 297–320. H. Kato, M. Fukushima: An SQP-type algorithm for nonlinear second-order cone programs. Optim. Lett. 1 (2007), 129–144. M. S. Lobo, L. Vandenberghe, S. Boyd, H. Lebret: Applications of second-order cone programming. Linear Algebra Appl. 284 (1998), 193–228. J.-S. Pang, D. Sun, J. Sun: Semismooth homeomorphisms and strong stability of semidefinite and Lorentz cone complementarity problems. Math. Oper. Res. 28 (2003), 39–63. L. Qi, J. Sun: A nonsmooth version of Newton’s method. Math. Program. 58 (1993), 353–367. D. Sun: The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31 (2006), 761–776. Y. Wang, L. Zhang: Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems. Math. Meth. Oper. Res. 70 (2009), 195–218.