Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm

DOI10.1137/0614069zbMath0788.65072OpenAlexW2000798143MaRDI QIDQ3142608

Chi-Geun Han, John A. Kaliski, Yinyu Ye, Panos M. Pardalos

Publication date: 30 May 1994

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

convergencepotential reduction algorithmcomputational tests\(P\)- matrix linear complementarity problem

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

Solving linear systems involved in constrained optimization, An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems, A new class of smoothing functions and a smoothing Newton method for complementarity problems, A note on quadratic convergence of a smoothing Newton algorithm for the LCP, A new smoothing Broyden-like method for solving nonlinear complementarity problem with a \(P_{0}\)-function, A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem, A note on generating \(P\)-matrices, Generalized principal pivot transforms, complementarity theory and their applications in stochastic games, A new smoothing and regularization Newton method for \(P_{0}\)-NCP, An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem, Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, Enhanced intersection cutting-plane approach for linear complementarity problems