General fixed-point method for solving the linear complementarity problem
From MaRDI portal
Recommendations
- A generalized Newton method for non-Hermitian positive definite linear complementarity problem
- Fixed point iterative algorithm for solving LCP
- Iterative entropy method for linear complementarity problem
- Generalized SOR-like iteration method for linear complementarity problem
- scientific article; zbMATH DE number 4054939
Cites work
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- A fixed point method for the linear complementarity problem arising from American option pricing
- A general accelerated modulus-based matrix splitting iteration method for solving linear complementarity problems
- A general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
- A non-modulus linear method for solving the linear complementarity problem
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- A relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems
- A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
- Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
- Comparisons of regular splittings of matrices
- Improving projected successive overrelaxation method for linear complementarity problems
- Modulus-based matrix splitting iteration methods for linear complementarity problems.
- New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems
- Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem
- On convergence of the modulus-based matrix splitting iteration method for horizontal linear complementarity problems of \(H_+\)-matrices
- On iterative solution for linear complementarity problem with an \(H_{+}\)-matrix
- On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
- On the gradient-projection method for solving the nonsymmetric linear complementarity problem
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Partial projected Newton method for a class of stochastic linear complementarity problems
- Projected gradient methods for linearly constrained problems
- Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- The relaxation modulus-based matrix splitting iteration method for solving linear complementarity problems of positive definite matrices
- Two-step modulus-based matrix splitting iteration method for linear complementarity problems
- Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
- \(H\)-splittings and two-stage iterative methods
Cited in
(8)- Gaussian pivoting method for solving linear complementarity problem
- Projected fixed point iterative method for large and sparse horizontal linear complementarity problem
- More on matrix splitting modulus-based iterative methods for solving linear complementarity problem
- The generalized linear complementarity problem and an algorithm to find all its solutions
- On general fixed point method based on matrix splitting for solving linear complementarity problem
- scientific article; zbMATH DE number 3936945 (Why is no real title available?)
- scientific article; zbMATH DE number 590964 (Why is no real title available?)
- Generalized SOR-like iteration method for linear complementarity problem
This page was built for publication: General fixed-point method for solving the linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2142788)
