Pages that link to "Item:Q1837116"

The following pages link to Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem (Q1837116):

Displaying 47 items.

• Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems (Q268353) (← links)
• Improved convergence theorems of multisplitting methods for the linear complementarity problem (Q280082) (← links)
• The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method (Q342867) (← links)
• Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem (Q372849) (← links)
• On the choice of parameters in MAOR type splitting methods for the linear complementarity problem (Q478194) (← links)
• A general preconditioner for linear complementarity problem with an \(M\)-matrix (Q507968) (← links)
• On convergence of two-stage splitting methods for linear complementarity problems (Q557714) (← links)
• IGAOR and multisplitting IGAOR methods for linear complementarity problems (Q631891) (← links)
• On the modulus algorithm for the linear complementarity problem. (Q703242) (← links)
• A new subclass of \(P\)-matrices (Q703643) (← links)
• On cone orderings and the linear complementarity problem (Q754772) (← links)
• On the convergence of SOR- and JOR-type methods for convex linear complementarity problems (Q808627) (← links)
• A multiplicative multisplitting method for solving the linear complementarity problem (Q979813) (← links)
• Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem (Q1019647) (← links)
• More results on the convergence of iterative methods for the symmetric linear complementarity problem (Q1061019) (← links)
• Parallel Newton methods for the nonlinear complementarity problem (Q1116901) (← links)
• Exceptional families and finite-dimensional variational inequalities over polyhedral convex sets (Q1126600) (← links)
• Matrices and the linear complementarity problem (Q1154944) (← links)
• A basic theorem of complementarity for the generalized variational-like inequality problem (Q1176164) (← links)
• The generalized quasi-variational inequality problem with applications (Q1176165) (← links)
• Projected successive overrelaxation method for finite-element solutions to the Dirichlet problem for a system of nonlinear elliptic equations (Q1184122) (← links)
• Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
• Solution of projection problems over polytopes (Q1185491) (← links)
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming (Q1188288) (← links)
• Two-stage parallel iterative methods for the symmetric linear complementarity problem (Q1201951) (← links)
• Linear complementarity problems and characterizations of Minkowski matrices (Q1248016) (← links)
• Hidden Z-matrices with positive principal minors (Q1260088) (← links)
• Error bounds and convergence analysis of feasible descent methods: A general approach (Q1312756) (← links)
• Adjustment process-based approach for computing a Nash-Cournot equilibrium (Q1317090) (← links)
• Modified AOR methods for linear complementarity problem (Q1406219) (← links)
• Modulus-based matrix splitting algorithms for the quasi-complementarity problems (Q1651423) (← links)
• An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems (Q1652800) (← links)
• Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix (Q1696438) (← links)
• Overlapping restricted additive Schwarz method with damping factor for \(H\)-matrix linear complementarity problem (Q1732154) (← links)
• Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results (Q1803603) (← links)
• An interior point multiplicative method for optimization under positivity constraints (Q1897269) (← links)
• Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
• A multisplitting method for symmetric linear complementarity problems (Q1917824) (← links)
• MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems (Q2017625) (← links)
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming (Q2277367) (← links)
• On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method (Q2347573) (← links)
• Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems (Q2360673) (← links)
• A generalized Newton method for non-Hermitian positive definite linear complementarity problem (Q2363671) (← links)
• On the convergence of iterative methods for symmetric linear complementarity problems (Q2366607) (← links)
• Generalized AOR methods for linear complementarity problem (Q2371393) (← links)
• A note on the MSMAOR method for linear complementarity problems (Q2805663) (← links)
• Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Nonlinear Complementarity Problems (Q5061755) (← links)