Pages that link to "Item:Q1231762"
From MaRDI portal
The following pages link to Solution of symmetric linear complementarity problems by iterative methods (Q1231762):
Displaying 50 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)
- Residual iterative method for solving absolute value equations (Q410174) (← links)
- Generalized AOR method for solving absolute complementarity problems (Q443063) (← 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)
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems (Q535254) (← links)
- On convergence of two-stage splitting methods for linear complementarity problems (Q557714) (← links)
- Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems (Q582015) (← links)
- Least-norm linear programming solution as an unconstrained minimization problem (Q593978) (← links)
- IGAOR and multisplitting IGAOR methods for linear complementarity problems (Q631891) (← links)
- Contact-aware simulations of particulate Stokesian suspensions (Q683397) (← links)
- Issues in computing contact forces for non-penetrating rigid bodies (Q686750) (← links)
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality (Q691483) (← links)
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a \(P\)-matrix (Q715065) (← links)
- Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems (Q739021) (← links)
- On the convergence properties of Hildreth's quadratic programming algorithm (Q749443) (← links)
- A multilevel iterative method for symmetric, positive definite linear complementarity problems (Q794138) (← links)
- On the convergence of SOR- and JOR-type methods for convex linear complementarity problems (Q808627) (← links)
- Finite convergence of algorithms for nonlinear programs and variational inequalities (Q809897) (← links)
- On the preconditioned GAOR method for a linear complementarity problem with an \(M\)-matrix (Q824703) (← links)
- Convergence of SSOR methods for linear complementarity problems (Q833585) (← links)
- A modified damped Newton method for linear complementarity problems (Q857647) (← links)
- Iterative algorithms for semi-linear quasi-complementarity problems (Q912001) (← links)
- Projection methods, isotone projection cones, and the complementarity problem (Q923351) (← links)
- Modified overrelaxed iterative solution schemes for separable generalized equations (Q999573) (← 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)
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems (Q1064037) (← links)
- Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs (Q1078096) (← links)
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming (Q1085068) (← links)
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods (Q1090250) (← links)
- A note on a quadratic formulation for linear complementarity problems (Q1090251) (← links)
- A new result in the theory and computation of the least-norm solution of a linear program (Q1091260) (← links)
- On the nonlinear complementarity problem (Q1092267) (← links)
- A dual exact penalty formulation for the linear complementarity problem (Q1093553) (← links)
- An LP-based successive overrelaxation method for linear complementarity problems (Q1093555) (← links)
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs (Q1103527) (← links)
- The quasi-complementarity problem (Q1103530) (← links)
- Iterative methods for a class of complementarity problems (Q1105987) (← links)
- Fixed point approach for complementarity problems (Q1105988) (← links)
- Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem (Q1116899) (← links)
- Pairwise reactive SOR algorithm for quadratic programming of net import spatial equilibrium models (Q1118531) (← links)
- Implementing proximal point methods for linear programming (Q1123124) (← links)
- Solution of nonsymmetric, linear complementarity problems by iterative methods (Q1134017) (← links)
- On the convergence of a basic iterative method for the implicit complementarity problem (Q1162935) (← links)
- The solution of linear complementarity problems on an array processor (Q1164382) (← links)
- A Gauss-Seidel iteration method for nonlinear variational inequality problems over rectangles (Q1166420) (← links)
