On the public citation graph
Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
0 signed · 100 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800040113openalex-snapshot
A quadratic programming procedure
inferredcites →https://doi.org/10.1007/bf00934765openalex-snapshot
On the convergence of a basic iterative method for the implicit complementarity problem
inferredcites →https://doi.org/10.1007/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf01442149openalex-snapshot
On the solution of large, structured linear complementarity problems: The block partitioned case
inferredcites →https://doi.org/10.1007/bf02594781openalex-snapshot
A dual differentiable exact penalty function
inferredcites →https://doi.org/10.1007/bfb0120964openalex-snapshot
On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
inferredcites →https://doi.org/10.1016/0021-9991(82)90078-xopenalex-snapshot
The solution of linear complementarity problems on an array processor
inferredcites →https://doi.org/10.1016/0024-3795(76)90037-9openalex-snapshot
On recurring theorems on diagonal dominance
inferredcites →https://doi.org/10.1016/0024-3795(78)90077-0openalex-snapshot
On cone orderings and the linear complementarity problem
inferredcites →https://doi.org/10.1016/0024-3795(79)90103-4openalex-snapshot
Hidden Z-matrices with positive principal minors
inferredcites →https://doi.org/10.1016/0305-0548(69)90004-5openalex-snapshot
Sparsity-preserving sor algorithms for separable quadratic and linear programming
inferredcites →https://doi.org/10.1016/c2013-0-10361-3openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
inferredcites →https://doi.org/10.1137/0309028openalex-snapshot
The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
inferredcites →https://doi.org/10.1137/0718039openalex-snapshot
Iterative Solution of Linear Programs
inferredcites →https://doi.org/10.1137/0904046openalex-snapshot
Multigrid Algorithms for the Solution of Linear Complementarity Problems Arising from Free Boundary Problems
inferredcites →https://doi.org/10.1287/mnsc.27.10.1142openalex-snapshot
A Hybrid Method for the Solution of Some Multi-Commodity Spatial Equilibrium Problems
inferredcites →https://doi.org/10.21236/ada103859openalex-snapshot
A Dual Differentiable Exact Penalty Function.
inferredcites →https://doi.org/10.21236/ada103865openalex-snapshot
Sparsity-Preserving SOR Algorithms for Separable Quadratic and Linear Programming.
inferredcites →https://doi.org/10.2307/1909424openalex-snapshot
Nonlinear Programming: A Unified Approach
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: A Unified Approach.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_479openalex-snapshot
Splitting Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_630openalex-snapshot
Splitting Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_2openalex-snapshot
Complementarity Problems. Origins and Definitions
inferred← citeshttps://doi.org/10.1007/bf00939250openalex-snapshot
More results on the convergence of iterative methods for the symmetric linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf00992845openalex-snapshot
An interior point multiplicative method for optimization under positivity constraints
inferred← citeshttps://doi.org/10.1007/bf01182323openalex-snapshot
A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
inferred← citeshttps://doi.org/10.1007/bf01385498openalex-snapshot
Solution of projection problems over polytopes
inferred← citeshttps://doi.org/10.1007/bf01581236openalex-snapshot
On the convergence of iterative methods for symmetric linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01581264openalex-snapshot
Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
inferred← citeshttps://doi.org/10.1007/bf01582258openalex-snapshot
Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
inferred← citeshttps://doi.org/10.1007/bf01585708openalex-snapshot
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
inferred← citeshttps://doi.org/10.1007/bf01589414openalex-snapshot
Parallel Newton methods for the nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01876142openalex-snapshot
A Bayesian algorithm for global optimization
inferred← citeshttps://doi.org/10.1007/bf02096261openalex-snapshot
Error bounds and convergence analysis of feasible descent methods: a general approach
inferred← citeshttps://doi.org/10.1007/bf02186474openalex-snapshot
Two-stage parallel iterative methods for the symmetric linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf02193464openalex-snapshot
Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
inferred← citeshttps://doi.org/10.1007/s00245-003-0767-5openalex-snapshot
A Self-Adaptive Projection and Contraction Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10092-016-0175-2openalex-snapshot
A generalized Newton method for non-Hermitian positive definite linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s10957-014-0589-4openalex-snapshot
On the Solution of the Linear Complementarity Problem by the Generalized Accelerated Overrelaxation Iterative Method
inferred← citeshttps://doi.org/10.1007/s11075-012-9664-9openalex-snapshot
Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s11075-014-9824-1openalex-snapshot
On the choice of parameters in MAOR type splitting methods for the linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s11075-014-9864-6openalex-snapshot
MSSOR-based alternating direction method for symmetric positive-definite linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s11075-016-0112-0openalex-snapshot
The solution of the linear complementarity problem by the matrix analogue of the accelerated overrelaxation iterative method
inferred← citeshttps://doi.org/10.1007/s11075-016-0243-3openalex-snapshot
Accelerated modulus-based matrix splitting iteration methods for a restricted class of nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1007/s11075-017-0405-yopenalex-snapshot
An inexact alternating direction method of multipliers for the solution of linear complementarity problems arising from free boundary problems
inferred← citeshttps://doi.org/10.1007/s40314-025-03528-wopenalex-snapshot
Acceleration of the modulus-based iteration methods for solving linear complementarity problems by momentum
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90396-eopenalex-snapshot
On the convergence of SOR- and JOR-type methods for convex linear complementarity problems
inferred← citeshttps://doi.org/10.1016/0098-1354(83)80004-0openalex-snapshot
Methods for quadratic programming: A survey
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90062-0openalex-snapshot
Adjustment process-based approach for computing a Nash-Cournot equilibrium
inferred← citeshttps://doi.org/10.1016/0377-0427(91)90170-oopenalex-snapshot
Projected successive overrelaxation method for finite-element solutions to the Dirichlet problem for a system of nonlinear elliptic equations
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00103-2openalex-snapshot
A multisplitting method for symmetric linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.amc.2006.09.067openalex-snapshot
Generalized AOR methods for linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.amc.2014.06.038openalex-snapshot
Improved convergence theorems of multisplitting methods for the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.amc.2015.08.100openalex-snapshot
Overlapping restricted additive Schwarz method with damping factor for H-matrix linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.apnum.2018.05.017openalex-snapshot
Modulus-based matrix splitting algorithms for the quasi-complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2004.11.018openalex-snapshot
On convergence of two-stage splitting methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2010.12.005openalex-snapshot
IGAOR and multisplitting IGAOR methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2016.02.011openalex-snapshot
Two-sweep modulus-based matrix splitting iteration methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2016.11.034openalex-snapshot
A general preconditioner for linear complementarity problem with an M -matrix
inferred← citeshttps://doi.org/10.1016/j.cam.2017.12.028openalex-snapshot
Comparison of three classes of algorithms for the solution of the linear complementarity problem with an H + -matrix
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.07.081openalex-snapshot
A multiplicative multisplitting method for solving the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.laa.2004.02.013openalex-snapshot
A new subclass of P-matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2009.02.024openalex-snapshot
Nonstationary Extrapolated Modulus Algorithms for the solution of the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1016/j.orl.2003.11.004openalex-snapshot
On the modulus algorithm for the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00194-7openalex-snapshot
Modified AOR methods for linear complementarity problem
inferred← citeshttps://doi.org/10.1080/00207160211927openalex-snapshot
Matrix Multisplitting Methods with Applications to Linear Complementarity Problems∶ Parallel Asynchronous Methods
inferred← citeshttps://doi.org/10.1080/00207168608803522openalex-snapshot
Iterative algorithms for the linear complementarity problem
inferred← citeshttps://doi.org/10.1080/00207169408804240openalex-snapshot
Accelerating iterative algorithms for symmetric linear complementarity problems
inferred← citeshttps://doi.org/10.1080/03081087.2016.1157135openalex-snapshot
A note on the MSMAOR method for linear complementarity problems
inferred← citeshttps://doi.org/10.1080/03081087.2017.1383347openalex-snapshot
The improved convergence of MSMMAOR method for linear complementarity problems
inferred← citeshttps://doi.org/10.1080/03081087.2021.1991874openalex-snapshot
Modulus-based inexact non-alternating preconditioned splitting method for linear complementarity problems
inferred← citeshttps://doi.org/10.1080/23311835.2016.1271268openalex-snapshot
A note on the unique solution of linear complementarity problem
inferred← citeshttps://doi.org/10.1109/cso.2009.224openalex-snapshot
Mixed-Type Splitting Iterative Method for Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1109/ijcnn.1989.118642openalex-snapshot
Brain-state-in-a-box neural networks with asymmetric coefficients
inferred← citeshttps://doi.org/10.1109/tmech.2022.3157852openalex-snapshot
Human–Robot Shared Control Based on Locally Weighted Intent Prediction for a Teleoperated Hydraulic Manipulator System
inferred← citeshttps://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferred← citeshttps://doi.org/10.1137/0329057openalex-snapshot
On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0330025openalex-snapshot
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
inferred← citeshttps://doi.org/10.1137/0610020openalex-snapshot
Continuous Homotopies for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0801009openalex-snapshot
Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0802004openalex-snapshot
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
inferred← citeshttps://doi.org/10.1137/0803008openalex-snapshot
Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/100811222openalex-snapshot
On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix
inferred← citeshttps://doi.org/10.1137/s0036144502420083openalex-snapshot
A Linear Complementarity Problem with a P-Matrix
inferred← citeshttps://doi.org/10.1137/s0895479897324032openalex-snapshot
On the Convergence of the Multisplitting Methods for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1260/174830107781389030openalex-snapshot
Generalized AOR Algorithms for Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1287/ijoc.10.2.218openalex-snapshot
Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
inferred← citeshttps://doi.org/10.1287/moor.18.2.317openalex-snapshot
Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.20.2.449openalex-snapshot
Asymptotic Convergence Analysis of the Forward-Backward Splitting Algorithm
inferred← citeshttps://doi.org/10.2298/fil2302467fopenalex-snapshot
The square-Newton iteration for linear complementarity problem
inferred← citeshttps://doi.org/10.3390/sym13030503openalex-snapshot
Relaxed Modulus-Based Matrix Splitting Methods for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.4018/978-1-4666-9644-0.ch021openalex-snapshot
Verification of Iterative Methods for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.340.3openalex-snapshot
A Preconditioned Gauss-Seidel Iterative Method for Linear Complementarity Problem in Intelligent Materials System
inferred← citeshttps://doi.org/10.4208/jics.v1.n2.p125openalex-snapshot
The Preconditioned Simultaneous Displacement Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.4208/jms.v48n1.15.01openalex-snapshot
Modulus-Based GSTS Iteration Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.4208/jms.v59n3.26.05openalex-snapshot
Anderson Acceleration of the Modulus-Based Iteration Methods for Solving Linear Complementarity Problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.