On the public citation graph
Error bounds for monotone linear complementarity problems
0 signed · 83 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.1007/bf02591989openalex-snapshot
Inexact Newton methods for the nonlinear complementarity problem
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.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1112/jlms/s1-40.1.378bopenalex-snapshot
THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
inferredcites →https://doi.org/10.1137/0325033openalex-snapshot
Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
inferredcites →https://doi.org/10.1287/moor.12.3.474openalex-snapshot
A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem
inferredcites →https://doi.org/10.2307/2314680openalex-snapshot
The Theory of Matrices in Numerical Analysis.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_3openalex-snapshot
Error Bounds for Convex Inequality Systems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3216-0_16openalex-snapshot
Error Bounds for Quadratic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14350-2_28openalex-snapshot
Error Bound for the Generalized Complementarity Problem in Engineering and Economic Equilibrium Modeling
inferred← citeshttps://doi.org/10.1007/bf00938311openalex-snapshot
An LP-based successive overrelaxation method for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf00939565openalex-snapshot
Implementing proximal point methods for linear programming
inferred← citeshttps://doi.org/10.1007/bf01300971openalex-snapshot
Local convergence of interior-point algorithms for degenerate monotone LCP
inferred← citeshttps://doi.org/10.1007/bf01432655openalex-snapshot
Error bounds for solutions of linear equations and inequalities
inferred← citeshttps://doi.org/10.1007/bf01448356openalex-snapshot
Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
inferred← citeshttps://doi.org/10.1007/bf01581148openalex-snapshot
New improved error bounds for the linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01582149openalex-snapshot
A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
inferred← citeshttps://doi.org/10.1007/bf01582210openalex-snapshot
Error bounds for analytic systems and their applications
inferred← citeshttps://doi.org/10.1007/bf01582267openalex-snapshot
Error bounds for nondegenerate monotone linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01585171openalex-snapshot
Nonlinear complementarity as unconstrained and constrained minimization
inferred← citeshttps://doi.org/10.1007/bf02023101openalex-snapshot
Error bounds and strong upper semicontinuity for monotone affine variational inequalities
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/bf02276920openalex-snapshot
Acceptable solutions of linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/bf02614384openalex-snapshot
On homogeneous and self-dual algorithms for LCP
inferred← citeshttps://doi.org/10.1007/s002110100362openalex-snapshot
New projection-type methods for monotone LCP with finite termination
inferred← citeshttps://doi.org/10.1007/s10107-005-0624-1openalex-snapshot
Error bounds for convex differentiable inequality systems in Banach spaces
inferred← citeshttps://doi.org/10.1007/s10107-007-0121-9openalex-snapshot
Error bounds for systems of lower semicontinuous functions in Asplund spaces
inferred← citeshttps://doi.org/10.1007/s10107-021-01720-4openalex-snapshot
Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints
inferred← citeshttps://doi.org/10.1007/s101070050023openalex-snapshot
Global s-type error bound for the extended linear complementarity problem and applications
inferred← citeshttps://doi.org/10.1007/s10114-014-2522-zopenalex-snapshot
Sufficient conditions for error bounds and linear regularity in Banach spaces
inferred← citeshttps://doi.org/10.1007/s10589-023-00482-3openalex-snapshot
A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems
inferred← citeshttps://doi.org/10.1007/s10898-011-9765-3openalex-snapshot
Exact penalty and error bounds in DC programming
inferred← citeshttps://doi.org/10.1007/s10957-009-9509-4openalex-snapshot
Global Error Bound for the Generalized Linear Complementarity Problem over a Polyhedral Cone
inferred← citeshttps://doi.org/10.1007/s10957-011-9903-6openalex-snapshot
Stability Analysis of One Stage Stochastic Mathematical Programs with Complementarity Constraints
inferred← citeshttps://doi.org/10.1007/s11784-018-0556-zopenalex-snapshot
A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
inferred← citeshttps://doi.org/10.1007/s40306-025-00592-6openalex-snapshot
Global Error Bounds for Nonmonotone Affine Variational Inequalities
inferred← citeshttps://doi.org/10.1016/0024-3795(90)90058-kopenalex-snapshot
Error bounds for the linear complementarity problem with a P-matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90049-gopenalex-snapshot
Global error bounds for monotone affine variational inequality problems
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00707-5openalex-snapshot
On a global projection-type error bound for the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0167-6377(88)90047-8openalex-snapshot
A simple characterization of solution sets of convex programs
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90080-mopenalex-snapshot
On a global error bound for a class of monotone affine variational inequality problems
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/0898-1221(95)00104-2openalex-snapshot
Error estimates and Lipschitz constants for best approximation in continuous function spaces
inferred← citeshttps://doi.org/10.1016/j.cam.2024.116288openalex-snapshot
Global error bound estimates algorithm for an R0 -type generalized LCP over polyhedral cone and its applications
inferred← citeshttps://doi.org/10.1016/j.jcp.2020.109524openalex-snapshot
A scalable computational platform for particulate Stokes suspensions
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/s0377-0427(02)00730-6openalex-snapshot
Some recent advances in projection-type methods for variational inequalities
inferred← citeshttps://doi.org/10.1023/a:1026434200384openalex-snapshot
Error Bounds for R0-Type and Monotone Nonlinear Complementarity Problems
inferred← citeshttps://doi.org/10.1023/b:svan.0000023396.58424.98openalex-snapshot
Error Bounds and Implicit Multifunction Theorem in Smooth Banach Spaces and Applications to Optimization
inferred← citeshttps://doi.org/10.1080/01630563.2021.1919897openalex-snapshot
An improvement on the global error bound estimation for ELCP and its applications
inferred← citeshttps://doi.org/10.1080/01630563.2023.2297426openalex-snapshot
Local Error Bounds for Affine Variational Inequalities on Hilbert Spaces
inferred← citeshttps://doi.org/10.1080/02331939408844003openalex-snapshot
Global error bounds for convex quadratic inequality systems *
inferred← citeshttps://doi.org/10.1080/10556780903057291openalex-snapshot
Error bounds for support vector machines with application to the identification of active constraints
inferred← citeshttps://doi.org/10.1109/apcip.2009.204openalex-snapshot
A Algorithm for the Nonlinear Complementarity Problem in Contact Mechanics Modeling
inferred← citeshttps://doi.org/10.1109/cinc.2009.133openalex-snapshot
A Smoothing Quadratically Convergent Algorithm for Generalized Linear Complementarity Problem in Engineering Modeling
inferred← citeshttps://doi.org/10.1115/1.4042690openalex-snapshot
A Unit-Consistent Error Measure for Multibody Systems With Unilateral Constraints
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/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/0802023openalex-snapshot
An Interior-Point Algorithm for Linearly Constrained Optimization
inferred← citeshttps://doi.org/10.1137/0802030openalex-snapshot
On the Continuity of the Solution Map in Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1137/s0363012993243022openalex-snapshot
Error Bounds for Piecewise Convex Quadratic Programs and Applications
inferred← citeshttps://doi.org/10.1137/s0895479892237744openalex-snapshot
Approximations to Solutions to Systems of Linear Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623496297012openalex-snapshot
A New SQP Algorithm for Large-Scale Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/s1052623498339739openalex-snapshot
On the Identification of Zero Variables in an Interior-Point Framework
inferred← citeshttps://doi.org/10.1137/s1052623499358884openalex-snapshot
Error Bounds for Lower Semicontinuous Functions in Normed Spaces
inferred← citeshttps://doi.org/10.1155/2012/219478openalex-snapshot
The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1155/2013/245485openalex-snapshot
Variational Inequalities and Vector Optimization
inferred← citeshttps://doi.org/10.1287/moor.20.2.441openalex-snapshot
Generalized Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1287/moor.21.4.793openalex-snapshot
Limiting Behavior of the Derivatives of Certain Trajectories Associated with a Monotone Horizontal Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1287/moor.24.1.72openalex-snapshot
Superlinear Convergence of an Algorithm for Monotone Linear Complementarity Problems, When No Strictly Complementary Solution Exists
inferred← citeshttps://doi.org/10.14569/ijacsa.2014.050622openalex-snapshot
The Solution Structure and Error Estimation for The Generalized Linear Complementarity Problem
inferred← citeshttps://doi.org/10.3934/naco.2013.3.627openalex-snapshot
Error bounds for symmetric cone complementarity problems
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.267.205openalex-snapshot
A Convergent Algorithm for Generalized Linear Complementarity Problem in Engineering Modeling
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.267.350openalex-snapshot
Error Estimation for a Economic Equilibrium Modeling
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.