Nonmonotone Inexact Newton Method for the Extended Linear Complementarity Problem

References

• R. Andreani and J. M. Martínez (1997). On the resolution of the extended linear complementarity problem. Linear Algebra. Appl. 281:247–257.
   Web of Science ®Google Scholar
• R. W. Cottle, J. S. Pang, and R. E. Stone (1992). The Linear Complementarity Problem. Academic Press, New York.
   Google Scholar
• F. Facchinei and C. Kanzow (1997). A nonsmooth inexact Newton method for the solution of large scale complementarity problems. Math. Prog. 76:493–512.
   Web of Science ®Google Scholar
• M. S. Gowda (1995). On reducing a monotone horizontal LCP to an LCP. Appl. Math. Lett. 8:97–100.
   Web of Science ®Google Scholar
• M. S. Gowda (1996). On the extended linear complementarity problems. Math. Prog. 72:33–50.
   Web of Science ®Google Scholar
• L. Grippo, F. Lampariello, and S. Lucidi (1996). A nonmonotone line search technique for Newton’s methods. SIAM J. Numer. Anal. 23:707–716.
   Web of Science ®Google Scholar
• C. Kanzow (1996). Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix. Anal. Appl. 17:851–868.
   Web of Science ®Google Scholar
• C. Kanzow (1997). A new approach to continuation methods for complementarity problems with uniformly P-function. Opera. Res. Lett. 20:85–92.
   Web of Science ®Google Scholar
• C. Kanzow (2004). Inexact semismooth Newton methods for large-scale complementarity problems. Optim. Meth. Soft. 19:309–325.
   Web of Science ®Google Scholar
• C. Kanzow and K. Piepe (1999). Jacobian smoothing methods for nonlinear complementarity problems. SIAM J. Optim. 9:342–373.
   Web of Science ®Google Scholar
• N. Krejić and J. M. Martínez (1999). Inexact-Newton methods for semismooth systems of equations with block angular structure. J. Comput. Appl. Math. 103:239–249.
   Web of Science ®Google Scholar
• N. Krejić and S. Rapajić (2008). Globally convergent Jacobian smoothing inexact Newton methods for NCP. Comput. Optim. Appl. 41:243–261.
   Web of Science ®Google Scholar
• F. M. Ma, Y. J. Wang, and H. G. Zhao (2010). A potential reduction method for the generalized linear complementarity problem over a polyhedral cone. J. Ind. Manage. Optim. 6:259–267.
   Web of Science ®Google Scholar
• O. L. Mangasarian and J. S. Pang (1995). The extended linear complementarity problem. SIAM J. Matrix Anal. Appl. 16:359–368.
   Web of Science ®Google Scholar
• J. M. Martínez and L. Qi (1995). Inexact Newton’s method for solving nonsmooth equations. J. Comput. Appl. Math. 60:127–145.
   Web of Science ®Google Scholar
• L. Qi, D. Sun, and G. Zhou (2000). A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math. Prog. 87:1–35.
   Web of Science ®Google Scholar
• M. V. Solodov (1999). Some optimization reformulations of the extended linear complementarity problem. Comput. Optim. Appl. 13:187–200.
   Web of Science ®Google Scholar
• H. C. Sun and Y. J. Wang (2013). Further discussion on the error bound for generalized LCP over a polyhedral cone. J. Optim. Theory. Appl. 159:93–107.
   Web of Science ®Google Scholar
• W. Y. Sun, J. Y. Han, and J. Sun (2002). Global convergence of non-monotone descent methods for unconstrained optimization problems. J. Comput. Appl. Math. 146:89–98.
   Web of Science ®Google Scholar
• H. C. Sun, Y. J. Wang, and L. Q. Qi (2009). Global error bound for the generalized linear comple mentarity problem over a polyhedral cone. J. Optim. Theory. Appl. 2:417–429.
   Web of Science ®Google Scholar
• L. Vandenberghe, B. L. De Moor, and J. Vandewalle (1989). The generalized linear complementarity problem applied to the complete analysis of resistive piecewise-linear circuits. IEEE Trans. Circuits. Sys. 36:1382–1391.
   Google Scholar
• Z. S. Yu and Q. Li (2009). A self-adaptive trust region method for the extended linear complementarity problems. Appl. Math. 54:53–65.
   Web of Science ®Google Scholar
• Z. S. Yu and D. G. Pu (2008). A new nonmonotone line search technique for unconstrained optimization. J. Comput. Appl. Math. 219:134–144.
   Web of Science ®Google Scholar
• Z. S. Yu, K. Su, and J. Lin (2009). A smoothing Levenberg–Marquardt method for the extended linear complementarity problem. Appl. Math. Model. 33:3409–3420.
   Web of Science ®Google Scholar
• J. L. Zhang and J. Chen (2006). A new noninterior predictor-corrector method for the P0 LCP. Appl. Math. Optim. 53:79–100.
   Web of Science ®Google Scholar
• H. C. Zhang and W. W. Hager (2004). A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14:1043–1056.
   Web of Science ®Google Scholar
• X. Z. Zhang, H. F. Jiang, and Y. J. Wang (2008). A smoothing Newton method for generalized nonlinear complementarity problem over a polyhedral con. J. Comput. Appl. Math. 212:75–85.
   Web of Science ®Google Scholar