Abstract
Based on the differential properties of the smoothing metric projector onto the second-order cone, we prove that, for a locally optimal solution to a nonlinear second-order cone programming problem, the nonsingularity of the Clarke’s generalized Jacobian of the smoothing Karush-Kuhn-Tucker system, constructed by the smoothing metric projector, is equivalent to the strong second-order sufficient condition and constraint nondegeneracy, which is in turn equivalent to the strong regularity of the Karush-Kuhn-Tucker point. Moreover, this nonsingularity property guarantees the quadratic convergence of the corresponding smoothing Newton method for solving a Karush-Kuhn-Tucker point. Interestingly, the analysis does not need the strict complementarity condition.
Similar content being viewed by others
References
Alizadeh F, Goldfarb D. Second-order cone programming. Math Program Ser B, 2003, 95: 3–51
Bonnans J F, Ramírez C H. Perturbation analysis of second-order cone programming problems. Math Program Ser B, 2005, 104: 205–227
Bonnans J F, Shapiro A. Perturbation Analysis of Optimization Problems. New York: Springer-Verlag, 2000
Chan Z X, Sun D. Constraint nondegeneracy, strong regularity and nonsingularity in semidefinite programming. SIAM J Optim, 2008, 19: 370–396
Chen J, Chen X, Tseng P. Analysis of nonsmooth vector-valued functions associated with second-order cones. Math Program Ser B, 2004, 101: 95–117
Chen X D, Sun D, Sun J. Complementarity functions and numerical experiments for second-order-cone complementarity problems. Comput Optim Appl, 2003, 25: 39–56
Clarke F H. On the inverse function theorem. Pacific J Math, 1976, 64: 97–102
Faraut J, Korányi A. Analysis on Symmetric Cones. Oxford: Clarendon Press, 1994
Fukushima M, Luo Z Q, Tseng P. Smoothing functions for second-order-cone complementarity problems. SIAM J Optim, 2001, 12: 436–460
Kato H, Fukushima M. An SQP-type algorithm for nonlinear second-order cone programs. Optim Lett, 2007, 1: 129–144
Kummer B. Lipschitzian inverse functions, directional derivatives, and applications in C1,1-optimization. J Optim Theory Appl, 1991, 70: 559–580
Pang J S, Sun D, Sun J. Semismooth homeomorphisms and strong stability of semidefinite and lorentz cone complementarity problems. Math Oper Res, 2003, 28: 39–63
Qi L, D Sun D, Zhou G. A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math Program Ser A, 2000, 87: 1–35
Rockafellar R T. Convex Analysis. Princeton: Princeton University Press, 1970
Sun D. The strong second order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math Oper Res, 2006, 31: 761–776
Sun J, Sun D, Qi L. A squared smoothing Newton method for nonsmooth matrix equations and its applications in semidefinite optimization problems. SIAM J Optim, 2004, 14: 783–806
Sun D, Sun J. Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions. Math Program Ser A, 2005, 103: 575–581
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, Y., Zhang, L. Nonsingularity in second-order cone programming via the smoothing metric projector. Sci. China Math. 53, 1025–1038 (2010). https://doi.org/10.1007/s11425-009-0207-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11425-009-0207-3
Keywords
- second-order cone programming problem
- smoothing metric projector
- B-subdifferential
- Clarke’s generalized Jacobian
- smoothing Newton method