On the public citation graph

Solution of nonsymmetric linear complementarity problems by iterative methods

https://doi.org/10.1007/bf00935545
0 signed · 143 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf01580248openalex-snapshot
Classes of functions and feasibility conditions in nonlinear complementarity problems
inferredcites →https://doi.org/10.1007/bf01696240openalex-snapshot
ИССЛЕДОВАНИЕ НЕКОТО РЫХ СЛОЖНЫХ ПОЛУПРОВОДНИКОВЫХ Т ВДРДЫХ РАСТВОРОВ И СОЕДИНЕНИЙ НА ОСНОВ Е ИНДИЯ
inferredcites →https://doi.org/10.1016/0024-3795(76)90037-9openalex-snapshot
On recurring theorems on diagonal dominance
inferredcites →https://doi.org/10.1080/01621459.1954.10483523openalex-snapshot
Point Estimates of Ordinates of Concave Functions
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0298961-7openalex-snapshot
The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences
inferredcites →https://doi.org/10.1137/0309028openalex-snapshot
The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1243/pime_proc_1941_146_027_02openalex-snapshot
A New Mathematical Method for the Solution of Film Lubrication Problems
inferredcites →https://doi.org/10.21136/cmj.1962.100526openalex-snapshot
On matrices with non-positive off-diagonal elements and positive principal minors
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cta.325openalex-snapshot
Design of linear phase FIR filters via linear complementarity problem approach
inferred← citeshttps://doi.org/10.1002/nla.2039openalex-snapshot
The modulus‐based matrix splitting algorithms for a class of weakly nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1002/nla.2044openalex-snapshot
Modulus‐based matrix splitting iteration methods for a class of implicit complementarity problems
inferred← citeshttps://doi.org/10.1002/nla.2207openalex-snapshot
A modulus iteration method for retinex problem
inferred← citeshttps://doi.org/10.1002/nla.2319openalex-snapshot
Modulus‐based synchronous multisplitting methods for solving horizontal linear complementarity problems on parallel computers
inferred← citeshttps://doi.org/10.1002/nla.680openalex-snapshot
Modulus-based matrix splitting iteration methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_122openalex-snapshot
EQUIVALENCE BETWEEN NONLINEAR COMPLEMENTARITY PROBLEM AND FIXED POINT PROBLEM
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_164openalex-snapshot
Equivalence Between Nonlinear Complementarity Problem and Fixed Point Problem
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_15openalex-snapshot
Algorithms for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/bf00934765openalex-snapshot
On the convergence of a basic iterative method for the implicit complementarity problem
inferred← citeshttps://doi.org/10.1007/bf00935463openalex-snapshot
A descent algorithm for solving monotone variational inequalities and monotone complementarity problems
inferred← citeshttps://doi.org/10.1007/bf00938311openalex-snapshot
An LP-based successive overrelaxation method for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf00939332openalex-snapshot
Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
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/bf01582288openalex-snapshot
Pairwise reactive sor algorithm for quadratic programming of net import spatial equilibrium models
inferred← citeshttps://doi.org/10.1007/bf01585112openalex-snapshot
Iterative methods for variational and complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01589410openalex-snapshot
Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf02072643openalex-snapshot
Parallel computation of intertemporal multicommodity spatial price equilibria in the presence of quotas
inferred← citeshttps://doi.org/10.1007/bf02073591openalex-snapshot
The Implicit General Order Complementarity Problem, models and iterative methods
inferred← citeshttps://doi.org/10.1007/bf02253616openalex-snapshot
Iterations for solving linear variational inequalities on domains with nonlinear boundaries
inferred← citeshttps://doi.org/10.1007/bf02591868openalex-snapshot
Iterative methods for linear complementarity problems with upperbounds on primary variables
inferred← citeshttps://doi.org/10.1007/s00190-019-01324-zopenalex-snapshot
A new iterative algorithm for a rank-deficient adjustment model with inequality constraints
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/s10255-006-0351-2openalex-snapshot
Multisplitting Iteration Schemes for Solving a Class of Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10589-025-00714-8openalex-snapshot
Improved Gauss-Seidel type and Jacobi type methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s10898-022-01263-8openalex-snapshot
A fixed point iterative method for tensor complementarity problems with the implicit Z-tensors
inferred← citeshttps://doi.org/10.1007/s10898-024-01392-2openalex-snapshot
The projected-type method for the extended vertical linear complementarity problem revisited
inferred← citeshttps://doi.org/10.1007/s10915-020-01299-6openalex-snapshot
A Fixed Point Iterative Method for Tensor Complementarity Problems
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/s10957-018-1395-1openalex-snapshot
Splitting Methods for a Class of Horizontal Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10957-021-01922-yopenalex-snapshot
Projected Splitting Methods for Vertical Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10957-023-02169-5openalex-snapshot
A Fixed Point Iterative Method for Third-order Tensor Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/s10957-023-02304-2openalex-snapshot
Improved Fixed Point Iterative Methods for Tensor Complementarity Problem
inferred← citeshttps://doi.org/10.1007/s10957-025-02908-wopenalex-snapshot
Vertical Linear Complementarity Problem Via the New Modulus-Based Matrix Splitting Method
inferred← citeshttps://doi.org/10.1007/s11075-009-9338-4openalex-snapshot
Shifted skew-symmetric iteration methods for nonsymmetric linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s11075-010-9416-7openalex-snapshot
Two-step modulus-based matrix splitting iteration method for linear complementarity problems
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/s11565-022-00429-2openalex-snapshot
A generalization of the equivalence relations between modulus-based and projected splitting methods
inferred← citeshttps://doi.org/10.1007/s11590-021-01781-6openalex-snapshot
A class of new modulus-based matrix splitting methods for linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s11590-023-02030-8openalex-snapshot
A projected splitting method for vertical tensor complementarity problems
inferred← citeshttps://doi.org/10.1007/s11590-024-02104-1openalex-snapshot
The projected splitting iterative methods based on tensor splitting and its majorization matrix splitting for the tensor complementarity problem
inferred← citeshttps://doi.org/10.1007/s11766-998-0040-4openalex-snapshot
A class of generalized multisplitting relaxation methods for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s12190-024-02211-3openalex-snapshot
Exploring two new iterative methods for solving absolute value equations
inferred← citeshttps://doi.org/10.1007/s12190-024-02334-7openalex-snapshot
Numerical exploration of two generalized iteration methods for solving nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1007/s12190-025-02664-0openalex-snapshot
Two fixed-point iteration methods for generalized absolute value equations: formulation and analysis
inferred← citeshttps://doi.org/10.1007/s12597-023-00634-3openalex-snapshot
More on matrix splitting modulus-based iterative methods for solving linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s13160-022-00526-xopenalex-snapshot
Two new fixed point iterative schemes for absolute value equations
inferred← citeshttps://doi.org/10.1007/s40305-023-00491-3openalex-snapshot
A Semidefinite Relaxation Method for Linear and Nonlinear Complementarity Problems with Polynomials
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/0022-247x(86)90219-2openalex-snapshot
Generalized quasi complementarity problems
inferred← citeshttps://doi.org/10.1016/0022-247x(88)90310-1openalex-snapshot
The quasi-complementarity problem
inferred← citeshttps://doi.org/10.1016/0022-247x(88)90408-8openalex-snapshot
Iterative methods for a class of complementarity problems
inferred← citeshttps://doi.org/10.1016/0022-247x(88)90413-1openalex-snapshot
Fixed point approach for complementarity problems
inferred← citeshttps://doi.org/10.1016/0022-247x(89)90347-8openalex-snapshot
Monotonicity of Mangasarian's iterative algorithm for generalized linear complementarity problems
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90277-mopenalex-snapshot
Projection methods, isotone projection cones, and the complementarity problem
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90408-8openalex-snapshot
Iterative algorithms for semi-linear quasi complementarity problems
inferred← citeshttps://doi.org/10.1016/0167-6377(82)90011-6openalex-snapshot
A Gauss-Seidel iteration method for nonlinear variational inequality problems over rectangles
inferred← citeshttps://doi.org/10.1016/0264-682x(86)90065-1openalex-snapshot
An interative scheme for complementarity problems
inferred← citeshttps://doi.org/10.1016/0377-0427(95)00087-9openalex-snapshot
Elastic-plastic unilateral contact problems for slackened systems
inferred← citeshttps://doi.org/10.1016/0377-0427(95)00092-5openalex-snapshot
Computer analysis of slackened systems under variable loads
inferred← citeshttps://doi.org/10.1016/j.amc.2003.12.108openalex-snapshot
How to improve MAOR method convergence area for 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.2006.09.089openalex-snapshot
On iterative criteria for H- and non-H-matrices
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128378openalex-snapshot
A new matrix splitting generalized iteration method for linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.apnum.2016.05.004openalex-snapshot
Modified modulus-based matrix splitting algorithms for a class of weakly nondifferentiable nonlinear complementarity problems
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.apnum.2020.11.011openalex-snapshot
A modulus-based multigrid method for image retinex
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.2013.09.079openalex-snapshot
Convergence of accelerated modulus-based matrix splitting iteration methods for linear complementarity problem with an H+ -matrix
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.cam.2022.114140openalex-snapshot
A relaxation general two-sweep modulus-based matrix splitting iteration method for solving linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2023.115138openalex-snapshot
The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.cam.2026.118162openalex-snapshot
Projected splitting methods for solving the generalized vertical polynomial complementarity problem
inferred← citeshttps://doi.org/10.1016/j.camwa.2019.06.012openalex-snapshot
The modulus-based matrix double splitting iteration method for linear complementarity problems
inferred← citeshttps://doi.org/10.1016/j.heliyon.2024.e34505openalex-snapshot
The study of new fixed-point iteration schemes for solving absolute value equations
inferred← citeshttps://doi.org/10.1016/j.jcp.2017.06.039openalex-snapshot
Contact-aware simulations of particulate Stokesian suspensions
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.laa.2011.03.009openalex-snapshot
Is A∈Cn,n a general H -matrix?
inferred← citeshttps://doi.org/10.1016/j.laa.2019.12.009openalex-snapshot
Improved error bounds based on α(M) for the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/j.orl.2009.01.013openalex-snapshot
Convergence of SSOR methods for linear complementarity problems
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/00207169708804569openalex-snapshot
Matrix multisplitting relaxation methods for 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/10637199708915590openalex-snapshot
A CLASS OF MULTI-PARAMETER RELAXED PARALLEL MULTISPLITTING METHODS FOR LARGE SPARSE LINEAR COMPLEMENTARITY PROBLEMS
inferred← citeshttps://doi.org/10.1109/access.2019.2920485openalex-snapshot
The Monomial Preconditioned SSOR Method for Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1109/cdc.1993.325134openalex-snapshot
Iterative methods for solving linear variational inequality
inferred← citeshttps://doi.org/10.1109/csf.2008.25openalex-snapshot
Security Decision-Making among Interdependent Organizations
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/tac.2016.2555879openalex-snapshot
Feedback Nash Equilibria in Linear-Quadratic Difference Games With Constraints
inferred← citeshttps://doi.org/10.1111/j.1467-8276.2007.00999.xopenalex-snapshot
Dynamic Efficiency Measurement: Theory and Application
inferred← citeshttps://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferred← citeshttps://doi.org/10.1137/0329006openalex-snapshot
Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
inferred← citeshttps://doi.org/10.1137/050636802openalex-snapshot
A New Iterative Criterion for H‐Matrices
inferred← citeshttps://doi.org/10.1137/0610020openalex-snapshot
Continuous Homotopies for the 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/110823328openalex-snapshot
On the Use of Policy Iteration as an Easy Way of Pricing American Options
inferred← citeshttps://doi.org/10.1155/2010/341982openalex-snapshot
Convergence Analysis of Preconditioned AOR Iterative Method for Linear Systems
inferred← citeshttps://doi.org/10.1155/2022/7934796openalex-snapshot
Numerical Solution of the Absolute Value Equations Using Two Matrix Splitting Fixed Point Iteration Methods
inferred← citeshttps://doi.org/10.1186/s13660-018-1789-5openalex-snapshot
On the preconditioned GAOR method for a linear complementarity problem with an M-matrix
inferred← citeshttps://doi.org/10.1186/s13660-026-03486-9openalex-snapshot
Parameter regulation and projection enhancement matrix splitting method: efficient solution for $\mathcal{H}_{+}$-matrix linear complementarity problems
inferred← citeshttps://doi.org/10.11948/20220400openalex-snapshot
CONVERGENCE OF THE TWO-POINT MODULUS-BASED MATRIX SPLITTING ITERATION METHOD
inferred← citeshttps://doi.org/10.11948/20230373openalex-snapshot
A TWO-STEP MATRIX SPLITTING METHOD FOR THE MIXED LINEAR COMPLEMENTARITY PROBLEM
inferred← citeshttps://doi.org/10.1260/174830107781389030openalex-snapshot
Generalized AOR Algorithms for Linear Complementarity Problem
inferred← citeshttps://doi.org/10.12732/ijam.v28i5.1openalex-snapshot
DIAGONAL MATRIX SCALING AND H-MATRICES
inferred← citeshttps://doi.org/10.1287/trsc.26.1.48openalex-snapshot
Parallel and Serial Successive Overrelaxation for Multicommodity Spatial Price Equilibrium Problems
inferred← citeshttps://doi.org/10.22436/jmcs.026.04.01openalex-snapshot
Iterative methods for solving absolute value equations
inferred← citeshttps://doi.org/10.2298/fil1508821fopenalex-snapshot
The general modulus-based Jacobi iteration method for linear complementarity problems
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.33993/jnaat531-1370openalex-snapshot
New accelerated modulus-based iteration method for solving large and sparse 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.4208/eajam.050911.060412aopenalex-snapshot
A New Preconditioned Generalised AOR Method for the Linear Complementarity Problem Based on a Generalised Hadjidimos Preconditioner
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
inferred← citeshttps://doi.org/10.4208/nmtma.oa-2017-0135openalex-snapshot
The Modulus-Based Levenberg-Marquardt Method for Solving Linear Complementarity Problem
inferred← citeshttps://doi.org/10.4208/nmtma.oa-2018-0034openalex-snapshot
Two-Step Modulus-Based Matrix Splitting Iteration Methods for a Class of Implicit Complementarity Problems
inferred← citeshttps://doi.org/10.5269/bspm.83730openalex-snapshot
Generalized Modulus-Based Iterative Method With Acceleration Parameter For Large-Scale Sparse Linear Complementarity Problems
inferred← citeshttps://doi.org/10.5287/ora-avqgmeovnopenalex-snapshot
Numerical solution of discretised HJB equations with applications in finance
inferred← citeshttps://doi.org/10.5815/ijem.2012.04.10openalex-snapshot
Convergence of SAOR Method for the Linear Complementarity Problems
inferred← citeshttps://doi.org/10.5815/ijitcs.2011.02.06openalex-snapshot
Two SAOR Iterative Formats 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.