Abstract.
Given , the linear complementarity problem (LCP) is to find such that (x, s)≥ 0,s=Mx+q,x Ts=0. By using the Chen-Harker-Kanzow-Smale (CHKS) smoothing function, the LCP is reformulated as a system of parameterized smooth-nonsmooth equations. As a result, a smoothing Newton algorithm, which is a modified version of the Qi-Sun-Zhou algorithm [Mathematical Programming, Vol. 87, 2000, pp. 1–35], is proposed to solve the LCP with M being assumed to be a P 0 -matrix (P 0 –LCP). The proposed algorithm needs only to solve one system of linear equations and to do one line search at each iteration. It is proved in this paper that the proposed algorithm has the following convergence properties: (i) it is well-defined and any accumulation point of the iteration sequence is a solution of the P 0 –LCP; (ii) it generates a bounded sequence if the P 0 –LCP has a nonempty and bounded solution set; (iii) if an accumulation point of the iteration sequence satisfies a nonsingularity condition, which implies the P 0 –LCP has a unique solution, then the whole iteration sequence converges to this accumulation point sub-quadratically with a Q-rate 2–t, where t∈(0,1) is a parameter; and (iv) if M is positive semidefinite and an accumulation point of the iteration sequence satisfies a strict complementarity condition, then the whole sequence converges to the accumulation point quadratically.
Similar content being viewed by others
References
Burke, J., Xu, S.: The global linear convergence of a non-interior path-following algorithm for linear complementarity problems. Math. Oper. Res. 23, 719–734 (1998)
Burke, J., Xu, S.: A non-interior predictor-corrector path-following algorithm for LCP. In: Fukushima, M., Qi, L., (eds.), Reformulation: Nonsmooth, Piecewise Smooth and Smoothing Methods, Kluwer Academic Publishers, Boston, 1999, pp. 45–64
Burke, J., Xu, S.: A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem. Math. Program. 87, 113–130 (2000)
Chen, B., Chen, X. J.: A global and local superlinear continuation-smoothing method for P 0+R 0 and monotone NCP. SIAM J. Optim. 9, 624–645 (1999)
Chen, B., Chen, X.J.: A global linear and local quadratic continuation smoothing method for variational inequalities with box constrains. Comput. Optim. Appl. 13, 131–158 (2000)
Chen, B., Harker, P.T.: A noninterior continuation method for quadratic and linear programming. SIAM J. Optim. 3, 503–515 (1993)
Chen, B., Harker, P.T.: A non-interior-point continuation method for linear complementarity problem. SIAM J. Matrix Anal. Appl. 14, 1168–1190 (1993)
Chen, B., Harker, P.T.: Smooth approximations to nonlinear complementarity problems. SIAM J. Optim. 7, 403–420 (1997)
Chen, B., Xiu, N.: A global linear and local quadratic non-interior continuation method for nonlinear complementarity problems based on Chen-Mangasarian smoothing functions. SIAM J. Optim. 9, 605–623 (1999)
Chen, C., Mangasarian, O.L.: Smoothing method for convex inequalities and linear complementarity problems. Math. Program. 71, 51–69 (1995)
Chen, C., Mangasarian, O.L.: A class of smoothing functions for nonlinear and mixed complementarity problems. Comput. Optim. Appl. 5, 97–138 (1996)
Chen, X., Qi, H.D., Tseng, P.: Analysis of nonsmooth symmetric-matrix functions with applications to semidefinite complementarity problems. SIAM J. Optim. 13, 960–985 (2003)
Chen, X., Tseng, P.: Non-interior continuation methods for solving semidefinite complementarity problems. Math. Program. 95, 431–474 (2003)
Chen, X.J., Qi, L., Sun, D.: Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities. Math. Comput. 67, 519–540 (1998)
Chen, X.J., Ye, Y.: On homotopy-smoothing methods for variational inequalities. SIAM J. Control Optim. 37, 589–616 (1999)
Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York, 1983
Engelke, S., Kanzow, C.: Predictor-corrector smoothing methods for the solution of linear programming. Preprint, Department of Mathematics, University of Hamburg, Germany, March 2000
Engelke, S., Kanzow, C., Improved smoothing-type methods for the solution of linear programming. Numer. Math. 90, 487–507 (2002)
Facchinei, F., Kanzow, C.: Beyond monotonicity in regularization methods for nonlinear complementarity problems. SIAM J. Control Optim. 37, 1150–1161 (1999)
Gabriel, S.A., Moré, J.J.: Smoothing of mixed complementarity problems. In: Ferris, M.C., Pang, J.S., (eds.), Complementarity and Variational Problems: State of the Art, SIAM, Philadelphia, 1996, pp. 105–116
Gowda, M.S., Sznajder, J.J.: Weak univalence and connectedness of inverse images of continuous functions. Math. Oper. Res. 24, 255–261 (1999)
Hoffman, A.J.: On approximate solutions of systems of linear equalities. J. Research Nat. Bur. Standards 49, 263–265 (1952)
Hotta, K., Yoshise, A.: Global convergence of a non-interior-point algorithms using Chen-Harker-Kanzow functions for nonlinear complementarity problems. Math. Program. 86, 105–133 (1999)
Huang, Z.H.: Sufficient condition on nonemptiness and boundedness of the solution set of the P 0 function nonlinear complementarity problem. Oper. Res. Lett. 30, 202–210 (2002)
Huang, Z.H., Han, J., Chen, Z.: A predictor-corrector smoothing Newton algorithm, based on a new smoothing function, for solving the nonlinear complementarity problem with a P 0 function. J. Optim. Theory Appl. 117, 39–68 (2003)
Kanzow, C.: Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17, 851–868 (1996)
Kanzow, C.: A new approach to continuation methods for complementarity problem with uniform P-function. Oper. Res. Lett. 20, 85–92 (1997)
Kanzow, C., Nagel, C.: Semidefinite programs: New search directions, smooth-type methods, and numerical results. SIAM J. Optim. 13, 1–23 (2002)
Kanzow, C., Pieper, H.: Jacobian smoothing methods for nonlinear complementarity problems. SIAM J. Optim. 9, 342–373 (1999)
Karamardian, S.: Complementarity problems over cones with monotone and pseudomonotone maps. J. Optim. Theory Appl. 18, 445–454 (1976)
Mclinden, L.: Stable monotone variational inequalities. Math. Program. 48, 303–338 (1990)
Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15, 957–972 (1977)
Qi, H.D.: A regularized smoothing Newton method for box constrained variational inequality problems with P 0-functions. SIAM J. Optim. 10, 315–330 (2000)
Qi, H.D., Liao, L.: A smoothing Newton method for general nonlinear complementarity problems. Comput. Optim. Appl. 17, 231–253 (2000)
Qi, L.: Convergence analysis of some algorithm for solving nonsmooth equations. Math. Oper. Res. 18, 227–244 (1993)
Qi, L., Sun, D.: Improving the convergence of non-interior point algorithm for nonlinear complementarity problems. Math. Comput. 69, 283–304 (2000)
Qi, L., Sun, D.: Smoothing functions and a smoothing Newton method for complementarity and variational inequality problems. J. Optim. Theory Appl. 113, 121–147 (2002)
Qi, L., Sun, D., Zhou, G.: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequality problems. Math. Program. 87, 1–35 (2000)
Qi, L., Sun, J.: A nonsmooth version of Newton’s method. Math. Program. 58, 353–367 (1993)
Ravindran, G., Gowda, M.S.: Regularization of P 0-functions in box variational inequality problems. SIAM J. Optim. 11, 748–760 (2001)
Smale, S: Algorithms for solving equations. In: Gleason, A.M., (ed.), Proceeding of International Congress of Mathematicians, American Mathematics Society, Providence, Rhode Island, 1987, pp. 172–195
Sun, D.: A regularization Newton method for solving nonlinear complementarity problems. Appl. Math. Optim. 36, 315–339 (1999)
Sun, D., Qi, L.: Solving variational inequality problems via smoothing-nonsmooth reformulations. J. Comput. Appl. Math. 129, 37–62 (2001)
Sun, J., Sun, D., Qi, L.: Quadratic convergence of a smoothing Newton method for nonsmooth matrix equations and its applications in semidefinite optimization problems. Preprint, Department of Decision Sciences, National University of Singapore, Republic of Singapore, October 2000, revised April 2002
Tseng, P.: Analysis of a non-interior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems. In: Fukushima, M., Qi, L., (eds.), Reformulation-Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Kluwer Academic Publishers, Boston, 1999, pp. 381–404
Tseng, P.: Error bounds and superlinear convergence analysis of some Newton-type methods in optimization. In: Di Pillo, G. and Giannessi, F., (eds.), Nonlinear Optimization and Related Topics, Kluwer Academic Publishers, Boston, 2000, pp. 445–462
Xu, S.: The global linear convergence of an infeasible non-interior path- following algorithm for complementarity problems with uniform P-functions. Math. Program. 87, 501–517 (2000)
Yamashita, N., Fukushima, M.: On the rate of convergence of the Levenberg-Marquardt method. Computing[Suppl] 15, 239–249 (2001)
Zhou, G., Sun, D., Qi, L.: Numerical experiments for a class of squared smoothing Newton Methods for box constrained variational inequality problems. In: Fukushima, M., Qi, L., (eds.), Reformulation-Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, Kluwer Academic Publishers, Boston, 1999, pp. 421–441
Author information
Authors and Affiliations
Corresponding author
Additional information
This author’s work is supported by the Hong Kong Research Grant Council and the Australian Research Council.
This author’s work is supported by Grant R146-000-035-101 of National University of Singapore.
Mathematics Subject Classification (1991): 90C33, 65K10
Rights and permissions
About this article
Cite this article
Huang, ZH., Qi, L. & Sun, D. Sub-quadratic convergence of a smoothing Newton algorithm for the P 0 – and monotone LCP. Math. Program., Ser. A 99, 423–441 (2004). https://doi.org/10.1007/s10107-003-0457-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-003-0457-8