Solution of nonsymmetric, linear complementarity problems by iterative methods
From MaRDI portal
Publication:1134017
DOI10.1007/BF00935545zbMath0422.90079MaRDI QIDQ1134017
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
convergence; iterative methods; Minkowski matrices; nonsymmetric linear complementarity problem; quasi-dominant diagonal matrices; SOR methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Matrix multisplitting relaxation methods for linear complementarity problems, A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS, A class of generalized multisplitting relaxation methods for linear complementarity problems, Solution of projection problems over polytopes, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, The implicit general order complementarity problem, models and iterative methods, Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas, Iterations for solving linear variational inequalities on domains with nonlinear boundaries, Elastic-plastic unilateral contact problems for slackened systems, Computer analysis of slackened systems under variable loads
