A note on quadratic convergence of a smoothing Newton algorithm for the LCP

DOI10.1007/s11590-011-0436-6zbMath1268.90104OpenAlexW2028448817MaRDI QIDQ1941195

Tie Ni, Sheng-Long Hu

Publication date: 12 March 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0436-6

zbMATH Keywords

linear complementarity problemquadratic convergencesmoothing Newton algorithm

Mathematics Subject Classification ID

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

Related Items (1)

On spectral hypergraph theory of the adjacency tensor

Cites Work

• A class of linear complementarity problems solvable in polynomial time
• Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms
• A regularization Newton method for solving nonlinear complementarity problems
• Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A nonsmooth version of Newton's method
• Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP
• A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties
• Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
• A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
• Optimization and nonsmooth analysis
• Global Optimization Approach to the Linear Complementarity Problem
• A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P₀LCPs
• Improving the convergence of non-interior point algorithms for nonlinear complementarity problems

This page was built for publication: A note on quadratic convergence of a smoothing Newton algorithm for the LCP