On the public citation graph

Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem

https://doi.org/10.1137/0803008
0 signed · 42 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/bf00934130openalex-snapshot
Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
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/bf00935004openalex-snapshot
On the gradient-projection method for solving the nonsymmetric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf00939250openalex-snapshot
More results on the convergence of iterative methods for the symmetric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf00939948openalex-snapshot
On the convergence of the coordinate descent method for convex differentiable minimization
inferredcites →https://doi.org/10.1007/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf02186474openalex-snapshot
Two-stage parallel iterative methods for the symmetric linear complementarity problem
inferredcites →https://doi.org/10.1016/0024-3795(90)90058-kopenalex-snapshot
Error bounds for the linear complementarity problem with a P-matrix
inferredcites →https://doi.org/10.1093/oso/9780199205219.003.0009openalex-snapshot
Introduction to optimization
inferredcites →https://doi.org/10.1137/0309028openalex-snapshot
The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
inferredcites →https://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferredcites →https://doi.org/10.1137/0325033openalex-snapshot
Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
inferredcites →https://doi.org/10.1137/0329057openalex-snapshot
On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/0702022openalex-snapshot
On the Solution of Singular and Semidefinite Linear Systems by Iteration
inferredcites →https://doi.org/10.1137/0801009openalex-snapshot
Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/0802004openalex-snapshot
Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
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.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-4615-0005-6_12openalex-snapshot
Optimization Methods in Massive Data Sets
inferred← citeshttps://doi.org/10.1007/978-1-4757-3279-5_14openalex-snapshot
A Class of Globally Convergent Algorithms for Pseudomonotone Variational Inequalities
inferred← citeshttps://doi.org/10.1007/bf00940488openalex-snapshot
Gauss-seidel method for least-distance problems
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/bf02193464openalex-snapshot
Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/s101070050020openalex-snapshot
New error bounds and their applications to convergence analysis of iterative algorithms
inferred← citeshttps://doi.org/10.1007/s10589-015-9777-xopenalex-snapshot
Bounded perturbation resilience of projected scaled gradient methods
inferred← citeshttps://doi.org/10.1007/s11590-014-0795-xopenalex-snapshot
Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization
inferred← citeshttps://doi.org/10.1007/s40305-014-0047-xopenalex-snapshot
On the Linear Convergence of the Approximate Proximal Splitting Method for Non-smooth Convex Optimization
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90076-0openalex-snapshot
Error bounds for inconsistent linear inequalities and programs
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00094-hopenalex-snapshot
On linear convergence of iterative methods for the variational inequality problem
inferred← citeshttps://doi.org/10.1016/s0377-0427(02)00730-6openalex-snapshot
Some recent advances in projection-type methods for variational inequalities
inferred← citeshttps://doi.org/10.1016/s0377-0427(97)00025-3openalex-snapshot
Descent methods with linesearch in the presence of perturbations
inferred← citeshttps://doi.org/10.1023/a:1022602123316openalex-snapshot
Convergence Analysis of Perturbed Feasible Descent Methods
inferred← citeshttps://doi.org/10.1080/10556788.2017.1296439openalex-snapshot
Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity
inferred← citeshttps://doi.org/10.1109/72.788643openalex-snapshot
Successive overrelaxation for support vector machines
inferred← citeshttps://doi.org/10.1109/tac.2019.2916985openalex-snapshot
Distributed Event-Triggered Gradient Method for Constrained Convex Minimization
inferred← citeshttps://doi.org/10.1137/0803022openalex-snapshot
A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints
inferred← citeshttps://doi.org/10.1137/s0363012993243022openalex-snapshot
Error Bounds for Piecewise Convex Quadratic Programs and Applications
inferred← citeshttps://doi.org/10.1137/s1052623493246045openalex-snapshot
A New Algorithm for Solving Strictly Convex Quadratic Programs
inferred← citeshttps://doi.org/10.1137/s1052623495287927openalex-snapshot
Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
inferred← citeshttps://doi.org/10.1287/moor.23.2.443openalex-snapshot
Global Error Bounds for Convex Multifunctions and Applications
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.