Projected fixed point iterative method for large and sparse horizontal linear complementarity problem

DOI10.1007/S13226-023-00403-4MaRDI QIDQ6572394zbMATH OpenFDO

Authors Bharat Kumar, Deepmala, A. K. Das

Publication date 15 July 2024

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S13226-023-00403-4

zbMATH Keywords

\(H_+\)-matrixconvergencehorizontal linear complementarity problemmatrix splitting

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Splitting methods for a class of horizontal linear complementarity problems
• On general fixed point method based on matrix splitting for solving linear complementarity problem
• Modulus-based matrix splitting methods for horizontal linear complementarity problems
• A two-step modulus-based matrix splitting iteration method for horizontal linear complementarity problems
• A two-step parallel iteration method for large sparse horizontal linear complementarity problems

Cites work

• \(H\)-splittings and two-stage iterative methods
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• Comparison results for proper nonnegative splittings of matrices
• General fixed-point method for solving the linear complementarity problem
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 3393631 (Why is no real title available?)
• Improving projected successive overrelaxation method for linear complementarity problems
• Modulus-based matrix splitting iteration methods for linear complementarity problems.
• Modulus-based matrix splitting methods for horizontal linear complementarity problems
• Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
• More on positive subdefinite matrices and the linear complementarity problem
• New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems
• On generalized positive subdefinite matrices and interior point algorithm
• On the classes of fully copositive and fully semimonotone matrices
• On the gradient-projection method for solving the nonsymmetric linear complementarity problem
• Partial projected Newton method for a class of stochastic linear complementarity problems
• Piecewise-Linear Theory of Nonlinear Networks
• Principal pivot transforms of some classes of matrices
• Projected gradient methods for linearly constrained problems
• Properties of some matrix classes based on principal pivot transform
• Singular control problems in bounded intervals
• Smoothing Projected Gradient Method and Its Application to Stochastic Linear Complementarity Problems
• Some Properties of Generalized Positive Subdefinite Matrices
• Splitting methods for a class of horizontal linear complementarity problems

Cited in

(3)

• On general fixed point method based on matrix splitting for solving linear complementarity problem
• More on projected type iteration method and linear complementarity problem
• New accelerated modulus-based iteration method for solving large and sparse linear complementarity problem

This page was built for publication: Projected fixed point iterative method for large and sparse horizontal linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572394)