Abstract
Two results on the second-order-cone complementarity problem are presented. We show that the squared smoothing function is strongly semismooth. Under monotonicity and strict feasibility we provide a new proof, based on a penalized natural complementarity function, for the solution set of the second-order-cone complementarity problem being bounded. Numerical results of squared smoothing Newton algorithms are reported.
Similar content being viewed by others
References
B. Chen, X. Chen, and C. Kanzow, “A penalized Fischer-Burmeister NCP-function,” Math. Prog., vol. 88, pp. 211-216, 2000.
F.H. Clarke, Optimization and Nonsmooth Analysis. Wiley: New York, 1983.
J.-P. Crouzeix, “Pseudomonotone variational inequality problems: Existence of solutions,” Math. Prog., vol. 78, pp. 305-314, 1997.
J. Faraut and A. Koranyi, Analysis on symmetric cones. Clarendon Press: Oxford, 1994.
L. Faybusovich, “Linear systems in Jordan algebras and primal-dual interior-point algorithms,” Journal of Comp. and Appl. Math., vol. 86, pp. 149-175, 1997.
M.C. Ferris and C. Kanzow, “Complementarity and related problems: A survey,” in P.M. Pardalos and M.G.C. Resende (Eds.), Handbook of Applied Optimization, Oxford University Press: New York, 2002, pp. 514-530.
M. Fukushima, Z.Q. Luo, and P. Tseng, “Smoothing functions for second-order-cone complementarity problems,” SIAM Journal on Optimization, vol. 12, pp. 436-460, 2002.
Y.R. He and K.F. Ng, “Characterize the boundedness of solution set of generalized complementarity problems,” Math. Prog., in press.
Z. Huang, L. Qi, and D. Sun, “Sub-quadratic convergence of a smoothing Newton algorithm for the P0-and monotone LCP,” http://www.math.nus.edu.sg/∼matsundf/.
C. Kanzow and C. Nagel, “Semidefinite programs: New search directions, smoothing-type methods, and numerical results,” SIAM Journal on Optimization, vol. 13, pp. 1-23, 2002. http://ifamus.mathematik. uni-wuerzburg.de/∼kanzow/.
M.S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret, “Applications of second-order cone programming,” Linear Alg. Appl., vol. 284, pp. 193-228, 1998.
L. McLinden, “Stable monotone variational inequalities,” Math. Prog., vol. 48, pp. 303-338, 1990.
J.S. Pang, “Complementarity problems,” In R. Horst and P. Pardalos (Eds.), Handbook in Global Optimization, Kluwer Academic Publishers: Boston, 1994.
L. Qi and J. Sun, “A nonsmooth version of Newton's method,” Math. Prog., vol. 58, pp. 353-367, 1993.
L. Qi, D. Sun, and G. Zhou, “A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities,” Math. Prog., vol. 87, pp. 1-35, 2001.
D. Sun and L. Qi, “Solving variational inequality problems via smoothing-nonsmooth reformulations,” J. Comput. Appl. Math., vol. 129, pp. 37-62, 2001.
D. Sun and J. Sun, “Semismooth matrix valued functions,” Math. Oper. Res., vol. 27, pp. 150-169, 2002.
J. Sun, D. Sun, and L. Qi, “Quadratic convergence of a squared smoothing Newton method for nonsmooth matrix equations and its applications in semidefinite optimization problems,” Technical Report, Department of Decision Sciences, National University of Singapore 2002, http://www.fba.nus.edu.sg/ depart/ds/sunjiehomepage/.
K.C. Toh, M.J. Todd, and R.H. Tütüncü, “SDPT3-AMatLab software package for semidefinite programming, version 2.1,” Optimization Methods and Software, vol. 11, pp. 545-581, 1999.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, X., Sun, D. & Sun, J. Complementarity Functions and Numerical Experiments on Some Smoothing Newton Methods for Second-Order-Cone Complementarity Problems. Computational Optimization and Applications 25, 39–56 (2003). https://doi.org/10.1023/A:1022996819381
Issue Date:
DOI: https://doi.org/10.1023/A:1022996819381