Skip to main content
SpringerLink
Log in

A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P 0-function

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we propose a new smoothing Broyden-like method for solving nonlinear complementarity problem with P 0 function. The presented algorithm is based on the smoothing symmetrically perturbed minimum function φ(a, b) = min{a, b} and makes use of the derivative-free line search rule of Li et al. (J Optim Theory Appl 109(1):123–167, 2001). Without requiring any strict complementarity assumption at the P 0-NCP solution, we show that the iteration sequence generated by the suggested algorithm converges globally and superlinearly under suitable conditions. Furthermore, the algorithm has local quadratic convergence under mild assumptions. Some numerical results are also reported in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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)

    Article  Google Scholar 

  2. Chen B., Ma C.: Superlinear/quadratic smoothing Broyden-like method for the generalized nonlinear complementarity problem. Nonlinear Anal. Real World Appl. 12, 1250–1263 (2011)

    Article  Google Scholar 

  3. Chen J., Pan S.: A family of NCP functions and a descent method for the nonlinear complementarity problem, Comput. Optim. Appl. 40, 389–404 (2008)

    Article  Google Scholar 

  4. Clarke F.H.: Optimization and nonsmooth analysis. Wiley, New York (1983)

    Google Scholar 

  5. Dennis J.E. Jr., Moré J.J.: A characterization of superlinear convergence and its applications to quasi-Newton methods. Math. Comput. 28, 549–560 (1974)

    Article  Google Scholar 

  6. Dirkse S., Ferris M.: MCPLIB: a collection of nonlinear mixed complementarity problems. Optim. Methods Softw. 5, 319–345 (1995)

    Article  Google Scholar 

  7. Dirkse S.P., Ferris M.C.: The PATH solver: a non-monotone stabilization scheme for mixed complementarity problems. Optimiz. Methods Softw. 5, 123–156 (1995)

    Article  Google Scholar 

  8. Fathi Y.: Computational complexity of LCPs associated with positive definite matrices. Math. Program. 17, 335–344 (1979)

    Article  Google Scholar 

  9. Ferris M.C., Munson T.S.: Interfaces to PATH 3.0: design, implementation and usage. Comput. Optim. Appl. 12, 207–227 (1999)

    Article  Google Scholar 

  10. Ferris M.C., Pang J.S.: Engineering and economic applications of complementarity problems. SIAM Rev. 39, 669–713 (1997)

    Article  Google Scholar 

  11. Fischer A.: Solution of monotone complementarity problems with locally Lipschitz functions. Math. Prog. 76(2), 513–532 (1997)

    Google Scholar 

  12. Fukushima M.: Merit Functions for Variational Inequality and Complementarity Problems. In: Di Pillo, G., Giannessi, F. (eds) Nonlinear Optimization and Applications, pp. 155–170. Plenum Press, New York (1996)

    Google Scholar 

  13. Geiger C., Kanzow C.: On the solution of monotone complementarity problems. Comput. Optim. Appl. 5, 155–173 (1996)

    Article  Google Scholar 

  14. Giannessi, F., Maugeri, A., Pardalos, P. M. (eds.): Equilibrium Problems: Nonsmooth Optimization and Variational Inequality Models Series: Nonconvex Optimization and its Applications, vol. 58, Springer, Heidelberg (2002)

  15. Harker P.T., Pang J.S.: Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms, and applications. Math. Program. 48, 339–357 (1990)

    Article  Google Scholar 

  16. Huang Z.H., Han J., Chen Z.: Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a P 0 function. J. Optim. Theory Appl. 117(1), 39–68 (2003)

    Article  Google Scholar 

  17. Jiang H., Qi L.: A new nonsmooth equations approach to nonlinear complementarity problems. SIAM J. Control Optim. 35, 178–193 (1997)

    Article  Google Scholar 

  18. Kanzow C.: Some equation-based methods for the nonlinear complementarity problem. Optim. Method Softw. 3, 327–340 (1994)

    Article  Google Scholar 

  19. Kanzow C.: Global convergence properties of some iterative methods for linear complementarity problems. Optimization 6, 326–334 (1996)

    Google Scholar 

  20. Kanzow C.: Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17, 851–868 (1996)

    Article  Google Scholar 

  21. Kanzow C., Kleinmichel H.: A new class of semismooth Newton-type methods for nonlinear complementarity problems. Comput. Optim. Appl. 11, 227–251 (1998)

    Article  Google Scholar 

  22. Li D.H., Fukushima M.: A derivative-free line search and global convergence of Broyden-like method for nonlinear equations. Optim. Methods Softw. 13(3), 181–201 (2000)

    Article  Google Scholar 

  23. Li D.H., Yamashita N., Fukushima M.: Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming. J. Optim. Theory Appl. 109(1), 123–167 (2001)

    Article  Google Scholar 

  24. Luca T.D., Facchinei F., Kanzow C.: A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Program. 75, 407–439 (1996)

    Article  Google Scholar 

  25. Ma C.: A new smoothing and regularization Newton method for P0-NCP. J. Glob. Optim. 48(2), 241–261 (2010)

    Article  Google Scholar 

  26. Ma C., Nie P., Liang G.: A new smoothing equations approach to the nonlinear complementarity problems. J. Comput. Math. 21, 747–758 (2003)

    Google Scholar 

  27. Ma C., Tang J., Chen X.: A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem. Appl. Math. Comput. 192, 370–381 (2007)

    Article  Google Scholar 

  28. Ma C., Chen X., Tang J.: On convergence of a smoothing Broyden-like method for P 0-NCP. Nonlinear Anal. Real World Appl. 9, 899–911 (2008)

    Article  Google Scholar 

  29. Ma C., Chen L., Wang D.: A globally and superlinearly convergent smoothing Broyden-like method for solving nonlinear complementarity problem. Appl. Math. Comput. 198, 592–604 (2008)

    Article  Google Scholar 

  30. Ma C., Jiang L., Wang D.: The convergence of a smoothing damped Gauss-Newton method for nonlinear complementarity problem. Nonlinear Anal. Real World Appl. 10, 2072–2087 (2009)

    Article  Google Scholar 

  31. Mifflin R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15, 957–972 (1977)

    Article  Google Scholar 

  32. Moré J.J., Rheinboldt W.C.: On P- and S-functions and related classes of n-dimensional nonlinear mappings. Linear Algebra Appl. 6(1), 45–68 (1973)

    Article  Google Scholar 

  33. Nie P.: A null space approach for solving nonlinear complementarity problems. Acta Math. Appl. Sin. (English Ser.) 22(1), 9–20 (2006)

    Article  Google Scholar 

  34. Pang J.S.: Complementarity problems. In: Horst, R., Pardalos, P. (eds) Handbook of Global Optimization, pp. 271–338. Kluwer, Boston (1995)

    Google Scholar 

  35. Pang J.S., Gabriel S.A.: NE/SQP: a robust algorithm for the nonlinear complementarity problem. Math. Program. 60, 295–337 (1993)

    Article  Google Scholar 

  36. Pardalos P.M., Ye Y., Han C.-G., Kalinski J.: Solution of P-matrix linear complementarity problems using a potential reduction algorithm. SIAM J. Matrix Anal. Appl. 14(4), 1048–1060 (1993)

    Article  Google Scholar 

  37. Pieraccini S., Gasparo M.G., Pasquali A.: Global Newton-type methods and semismooth reformulations for NCP. Appl. Numer. Math. 44, 367–384 (2003)

    Article  Google Scholar 

  38. Qi L.: Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18, 227–244 (1993)

    Article  Google Scholar 

  39. Qi L., Sun J.: A nonsmooth version of Newton’s method. Math. Prog. 58(2), 353–367 (1993)

    Article  Google Scholar 

  40. Xu S.: The global linear convergence of an infeasible noninterior path-following algorithm for complementarity problems with uniform P-functions. Math. Program. 87, 501–517 (2000)

    Article  Google Scholar 

  41. Zhang L., Han J., Huang Z.: Superlinear/quadratic one-step smoothing Newton method for P 0-NCP. Acta Math. Sin. (Eniglish Ser.) 21(1), 117–128 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Computer Science, Fujian Normal University, 350007, Fuzhou, China

    Bilian Chen & Changfeng Ma

  2. Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, Hong Kong

    Bilian Chen

Authors
  1. Bilian Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Changfeng Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Changfeng Ma.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, B., Ma, C. A new smoothing Broyden-like method for solving nonlinear complementarity problem with a P 0-function. J Glob Optim 51, 473–495 (2011). https://doi.org/10.1007/s10898-010-9640-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-010-9640-7

Keywords

Search

Navigation