On smoothing methods for the P₀ matrix linear complementarity problem

DOI10.1137/S1052623498335080MaRDI QIDQ2706332zbMATH OpenOpenAlexFDO

Authors Xiaojun Chen, Yinyu Ye

Publication date 19 March 2001

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623498335080

zbMATH Keywords

\(P_0\) matrixglobal convergencelinear complementarity problemnumerical resultssmoothing algorithm

Mathematics Subject Classification ID

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

Recommendations

• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
• A quadratically convergent inexact smoothing Newton method for \(\text{P}_0\)-LCP
• A continuation method for linear complementarity problems with \({P}_{0}\) matrix
• Global linear and quadratic one-step smoothing Newton method for \(P_0\)-LCP
• Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity.

Cited in

(19)

• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
• A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
• Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
• A smoothing Levenberg-Marquardt method for NCP
• Analysis on the smoothing method for the \(P\)-linear complementarity systems
• A smoothing least squares method for nonlinear complementarity problem
• A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics
• On solving linear complementarity problems by DC programming and DCA
• A feasible decomposition method for constrained equations and its application to complementarity problems
• An asymptotic approach for testing \(P_{0}\)-matrices
• The improved convergence theorems of modulus-based matrix splitting iteration methods for a class of nonlinear complementarity problems with \(H\)-matrices
• A continuation method for linear complementarity problems with \({P}_{0}\) matrix
• A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution
• A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems
• Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations
• Active-set projected trust-region algorithm for box-constrained nonsmooth equations
• A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
• A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search

This page was built for publication: On smoothing methods for the \(P_{0}\) matrix linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2706332)