Iterative algorithms for the linear complementarity problem
Direct complementary pivot algorithms for the linear complementarity problem with P-matrices are known to have exponential computational complexity. The analog of Gauss-Seidel and SOR iteration for linear complementarity problems with P-matrices has not been extensively developed. This paper extends some work of \textit{W. M. G. van Bokhoven} [A class of linear complementarity problems is solvable in polynomial time, unpublished paper, Dept. of Electrical Engineering, University of Technology, The Netherlands (1980)] to a class of nonsymmetric P- matrices, and develops and compares several new iterative algorithms for the linear complementarity problem. Numerical results for several hundred test problems are presented. Such indirect iterative algorithms may prove useful for large sparse complementarity problems.
- scientific article; zbMATH DE number 53115
- An iterative two-step algorithm for linear complementarity problems
- Iterative methods for a class of complementarity problems
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
- Iterative methods of solutions for linear and quasi-linear complementarity problems
- A Partition Theorem for Euclidean n-Space
- A Probelm in Linear Inequalities
- An algorithm for the linear complementarity problem
- Bimatrix Equilibrium Points and Mathematical Programming
- Complementary pivot theory of mathematical programming
- Computational complexity of complementary pivot methods
- Efficient higher order implicit one-step methods for integration of stiff differential equations
- Elasto-hydrodynamic lubrication: A non-linear complementarity problem
- Equilibrium Points of Bimatrix Games
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 3538668 (Why is no real title available?)
- scientific article; zbMATH DE number 3240705 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- Iterative methods for linear complementarity problems with upperbounds on primary variables
- Linear complementarity problems solvable by a single linear program
- Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
- Newton's method for linear complementarity problems
- On the convergence of a basic iterative method for the implicit complementarity problem
- On the Convergence Rate of Algorithms for Solving Equations that are Based on Methods of Complementary Pivoting
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Q-matrices and spherical geometry
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Solution of symmetric linear complementarity problems by iterative methods
- Solving the Nonlinear Complementarity Problem by a Homotopy Method
- The complementarity problem
- The Linear Complementarity Problem
- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- On tridiagonal linear complementarity problems
- Iterative methods for linear complementarity problems with interval data
- Modulus-based matrix splitting algorithms for the quasi-complementarity problems
- Comparison of three classes of algorithms for the solution of the linear complementarity problem with an \(H_+\)-matrix
- A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
- A class of new modulus-based matrix splitting methods for linear complementarity problem
- On the solution of the linear complementarity problem by the generalized accelerated overrelaxation iterative method
- Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an H_+-matrix
- Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
- A note on the MSMAOR method for linear complementarity problems
- scientific article; zbMATH DE number 3862340 (Why is no real title available?)
- scientific article; zbMATH DE number 4213737 (Why is no real title available?)
- The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
- scientific article; zbMATH DE number 29065 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- On Volterra-Lotka differential equations and multiplicative algorithms for monotone complementarity problems
- scientific article; zbMATH DE number 177992 (Why is no real title available?)
- scientific article; zbMATH DE number 716152 (Why is no real title available?)
- scientific article; zbMATH DE number 1961130 (Why is no real title available?)
- scientific article; zbMATH DE number 2077071 (Why is no real title available?)
- Solving the Linear Complementarity Problem in Circuit Simulation
- On the choice of parameters in MAOR type splitting methods for the linear complementarity problem
- Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
- Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Nonlinear Complementarity Problems
- scientific article; zbMATH DE number 4197293 (Why is no real title available?)
- Preconditioned SSOR methods for the linear complementarity problem with M-matrix
- Modulus-based Synchronous Multisplitting Iteration Methods for an Implicit Complementarity Problem
- scientific article; zbMATH DE number 3353068 (Why is no real title available?)
- An improved block modulus method for diagonally dominant linear complementarity problems
- Improved algorithms for linear complementarity problem arising from collision response
- Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems
- More on matrix splitting modulus-based iterative methods for solving linear complementarity problem
- New accelerated modulus-based iteration method for solving large and sparse linear complementarity problem
- A note on fixed point method and linear complementarity problem
- On the modulus algorithm for the linear complementarity problem.
- Optimization of extrapolated Cayley transform with non-Hermitian positive definite matrix
- On the preconditioned GAOR method for a linear complementarity problem with an M-matrix
- The principle of extrapolation and the Cayley transform
This page was built for publication: Iterative algorithms for the linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800997)