A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems

The second-order cone complementarity problem (SOCCP) is a wide class of problems containing the nonlinear complementarity problem (NCP) and the second-order cone programming problem (SOCP). Recently, Fukushima, Luo, and Tseng [SIAM J. Optim., 12 (2001), pp. 436--460] extended some merit functions and their smoothing functions for NCP to SOCCP. Moreover, they derived computable formulas for the Jacobians of the smoothing functions and gave conditions for the Jacobians to be invertible. In this paper, we propose a globally and quadratically convergent algorithm, which is based on smoothing and regularization methods, for solving monotone SOCCP. In particular, we study strong semismoothness and Jacobian consistency, which play an important role in establishing quadratic convergence of the algorithm. Furthermore, we examine the effectiveness of the algorithm by means of numerical experiments.

[1]  Houduo Qi,et al.  A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions , 1999, SIAM J. Optim..

[2]  Paul Tseng,et al.  Analysis of nonsmooth vector-valued functions associated with second-order cones , 2004, Math. Program..

[3]  Defeng Sun,et al.  Smoothing Functions and Smoothing Newton Method for Complementarity and Variational Inequality Problems , 2002 .

[4]  F. Facchinei,et al.  Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems , 1999 .

[5]  Olvi L. Mangasarian,et al.  A class of smoothing functions for nonlinear and mixed complementarity problems , 1996, Comput. Optim. Appl..

[6]  Alexander Shapiro,et al.  On a Class of Nonsmooth Composite Functions , 2003, Math. Oper. Res..

[7]  Christian Kanzow,et al.  Jacobian Smoothing Methods for Nonlinear Complementarity Problems , 1999, SIAM J. Optim..

[8]  Xiaojun Chen,et al.  Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities , 1998, Math. Comput..

[9]  H. Upmeier.  ANALYSIS ON SYMMETRIC CONES (Oxford Mathematical Monographs) , 1996 .

[10]  Defeng Sun,et al.  A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities , 2000, Math. Program..

[11]  Masao Fukushima,et al.  Smoothing Functions for Second-Order-Cone Complementarity Problems , 2002, SIAM J. Optim..

[12]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[13]  Masao Fukushima,et al.  Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems , 1996, Math. Program..

[14]  Liqun Qi,et al.  A nonsmooth version of Newton's method , 1993, Math. Program..

[15]  R. Mifflin.  Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[16]  R. Palais,et al.  Critical Point Theory and Submanifold Geometry , 1988 .

[17]  Takashi Tsuchiya,et al.  Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions , 2000, Math. Program..

[18]  Xiaojun Chen.  SMOOTHING METHODS FOR COMPLEMENTARITY PROBLEMS AND THEIR APPLICATIONS : A SURVEY , 2000 .

[19]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[20]  Masao Fukushima,et al.  A hybrid Newton method for solving the variational inequality problem via the D-gap function , 1999, Math. Program..

[21]  T. Tsuchiya.  A Convergence Analysis of the Scaling-invariant Primal-dual Path-following Algorithms for Second-ord , 1998 .

[22]  T. Zolezzi,et al.  Well-Posed Optimization Problems , 1993 .

[23]  L. Qi,et al.  A Globally Convergent Successive Approximation Method for Severely Nonsmooth Equations , 1995 .