On Smoothing Methods for the P0 Matrix Linear Complementarity Problem
From MaRDI portal
Publication:2706332
DOI10.1137/S1052623498335080zbMath0994.65077MaRDI QIDQ2706332
Publication date: 19 March 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
global convergence; numerical results; linear complementarity problem; smoothing algorithm; \(P_0\) matrix
65K05: Numerical mathematical programming methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
An Asymptotic Approach for Testing P0-Matrices, A continuation method for linear complementarity problems withP0matrix, A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution, 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, Active-set projected trust-region algorithm for box-constrained nonsmooth equations, A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search, 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, A smoothing least square method for nonlinear complementarity problem
