Open Mathematics · 2019 · 15 citations · 44 references
ComputingComputer ScienceAlgorithmsComputational MechanicsOptimizationConvergence AnalysisIterative SolversNumerical AlgorithmsNumerical AnalysisNumerical ConvergenceNumerical Methods For Differential EquationsComplementarity ProblemsLocal Convergence AnalysisNewton ConvergenceNonlinear Complementarity ProblemsNonlinear Equation SolversSmoothingSmoothing Techniques
Abstract In this paper, a new improved smoothing Newton algorithm for the nonlinear complementarity problem was proposed. This method has two-fold advantages. First, compared with the classical smoothing Newton method, our proposed method needn’t nonsingular of the smoothing approximation function; second, the method also inherits the advantage of the classical smoothing Newton method, it only needs to solve one linear system of equations at each iteration. Without the need of strict complementarity conditions and the assumption of P 0 property, we get the global and local quadratic convergence properties of the proposed method. Numerical experiments show that the efficiency of the proposed method.
44
A nonsmooth version of Newton's method
Liqun Qi, Jie Sun · Mathematical Programming · 1993 · 1.5K citations
Engineering and Economic Applications of Complementarity Problems
Michael C. Ferris, Jong‐Shi Pang · SIAM Review · 1997 · 1.1K citations
A special newton-type optimization method
Andreas Fischer · Optimization · 1992 · 754 citations