Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity.

DOI10.1016/S0096-3003(02)00234-5zbMath1049.65054OpenAlexW2023913568MaRDI QIDQ1406258

Li-ping Zhang, Zi-You Gao

Publication date: 9 September 2003

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(02)00234-5

zbMATH Keywords

global convergencesmoothingNewton's methodlinear complementarity problemquadratic convergenceline search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of large scale mixed complementarity problem solvers
• A new approach to continuation methods for complementarity problems with uniform \(P\)-functions
• The non-interior continuation methods for solving the \(P_0\) function nonlinear complementarity problem
• Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems
• A regularization Newton method for solving nonlinear complementarity problems
• A class of smoothing functions for nonlinear and mixed complementarity problems
• A smoothing Newton method for general nonlinear complementarity problems
• Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
• Smoothing methods for convex inequalities and linear complementarity problems
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
• A nonsmooth version of Newton's method
• Regularization of P₀-Functions in Box Variational Inequality Problems
• The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
• Weak Univalence and Connectedness of Inverse Images of Continuous Functions
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
• A special newton-type optimization method
• Smooth Approximations to Nonlinear Complementarity Problems
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
• Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
• A Smoothing Newton Method for Extended Vertical Linear Complementarity Problems
• Jacobian Smoothing Methods for Nonlinear Complementarity Problems
• A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
• A Global and Local Superlinear Continuation-Smoothing Method forP₀andR₀NCP or Monotone NCP
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.
• Solving variational inequality problems via smoothing-nonsmooth reformulations