On the public citation graph

Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem

https://doi.org/10.1137/0801009
0 signed · 56 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/b97412openalex-snapshot
Introduction to Optimization
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/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.1007/bf02591989openalex-snapshot
Inexact Newton methods for the nonlinear complementarity problem
inferredcites →https://doi.org/10.1007/bf02591991openalex-snapshot
Error bounds for monotone linear complementarity problems
inferredcites →https://doi.org/10.1007/bfb0121071openalex-snapshot
Simple computable bounds for solutions of linear complementarity problems and linear programs
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

What points at this work

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

inferred← citeshttps://doi.org/10.1002/nla.609openalex-snapshot
A modified modulus method for symmetric positive‐definite linear complementarity problems
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_479openalex-snapshot
Splitting Method for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_77openalex-snapshot
Cost Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_101openalex-snapshot
Cost Approximation Algorithms
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-3141-5_2openalex-snapshot
Complementarity Problems. Origins and Definitions
inferred← citeshttps://doi.org/10.1007/978-1-4757-3279-5_11openalex-snapshot
Data Discrimination via Nonlinear Generalized Support Vector Machines
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/978-3-030-54621-2_101-1openalex-snapshot
Cost Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/bf00247654openalex-snapshot
An inexact NE/SQP method for solving the nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf00940488openalex-snapshot
Gauss-seidel method for least-distance problems
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/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/s10589-015-9777-xopenalex-snapshot
Bounded perturbation resilience of projected scaled gradient methods
inferred← citeshttps://doi.org/10.1007/s11075-006-9028-4openalex-snapshot
A modified damped Newton method for linear complementarity problems
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/0377-0427(94)00094-hopenalex-snapshot
On linear convergence of iterative methods for the variational inequality problem
inferred← citeshttps://doi.org/10.1016/j.cam.2008.02.013openalex-snapshot
Inexact multisplitting methods for linear complementarity problems
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.1051/ro/2013027openalex-snapshot
Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems
inferred← citeshttps://doi.org/10.1080/00207169708804568openalex-snapshot
Splitting methods for quadratic optimization in data analysis
inferred← citeshttps://doi.org/10.1080/02331934.2026.2637847openalex-snapshot
Accelerated overrelaxation algorithm for optimizing twin random vector functional link regression
inferred← citeshttps://doi.org/10.1080/10556780512331318146openalex-snapshot
Parallel algorithm for support vector machines training and quadratic optimization problems
inferred← citeshttps://doi.org/10.1109/72.788643openalex-snapshot
Successive overrelaxation for support vector machines
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/0801029openalex-snapshot
Parallel Constraint Distribution
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/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/s0363012994268655openalex-snapshot
Modified Projection-Type Methods for Monotone Variational Inequalities
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.18.2.317openalex-snapshot
Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.23.2.443openalex-snapshot
Global Error Bounds for Convex Multifunctions and Applications
inferred← citeshttps://doi.org/10.1504/ijsnet.2015.067584openalex-snapshot
A decentralised linear programming approach to energy-efficient event detection
inferred← citeshttps://doi.org/10.3390/sym9080163openalex-snapshot
Distributed Newton Methods for Strictly Convex Consensus Optimization Problems in Multi-Agent Networks
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.48550/arxiv.1404.5350openalex-snapshot
On the Linear Convergence of the Approximate Proximal Splitting Method for Non-Smooth Convex Optimization
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.