On the public citation graph
Error bounds for nondegenerate monotone linear complementarity problems
0 signed · 64 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/bf01594944openalex-snapshot
Finite termination of the proximal point algorithm
inferredcites →https://doi.org/10.1007/bf02591991openalex-snapshot
Error bounds for monotone linear complementarity problems
inferredcites →https://doi.org/10.1007/bfb0120987openalex-snapshot
Characterizations of bounded solutions of linear complementarity problems
inferredcites →https://doi.org/10.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1016/0167-6377(88)90047-8openalex-snapshot
A simple characterization of solution sets of convex programs
inferredcites →https://doi.org/10.1093/oso/9780195057294.003.0014openalex-snapshot
Least Norm Solution Of Nonmonotone Linear Complementarity Problems
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/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0317052openalex-snapshot
Nonlinear Perturbation of Linear Programs
inferredcites →https://doi.org/10.1137/0325033openalex-snapshot
Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
inferredcites →https://doi.org/10.2307/2314680openalex-snapshot
The Theory of Matrices in Numerical Analysis.
inferredcites →https://doi.org/10.31857/s04247388openalex-snapshot
Economics and Mathematical Methods
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-4757-3141-5_2openalex-snapshot
Complementarity Problems. Origins and Definitions
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/bf01432655openalex-snapshot
Error bounds for solutions of linear equations and inequalities
inferred← citeshttps://doi.org/10.1007/bf01581148openalex-snapshot
New improved error bounds for the linear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf01581155openalex-snapshot
Superlinear convergence of infeasible-interior-point methods for linear programming
inferred← citeshttps://doi.org/10.1007/bf01594944openalex-snapshot
Finite termination of the proximal point algorithm
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/bf02192639openalex-snapshot
Growth behavior of a class of merit functions for the nonlinear complementarity problem
inferred← citeshttps://doi.org/10.1007/bf02206813openalex-snapshot
A path-following interior-point algorithm for linear and quadratic problems
inferred← citeshttps://doi.org/10.1007/bf02592215openalex-snapshot
A superquadratic infeasible-interior-point method for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/s00245-004-0799-5openalex-snapshot
Sufficient Conditions for Error Bounds and Applications
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/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/s10957-013-0290-zopenalex-snapshot
Further Discussion on the Error Bound for Generalized Linear Complementarity Problem over a Polyhedral Cone
inferred← citeshttps://doi.org/10.1007/s10957-013-0460-zopenalex-snapshot
On Finite Convergence of Iterative Methods for Variational Inequalities in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s10957-014-0689-1openalex-snapshot
Finite Termination of Inexact Proximal Point Algorithms in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s11228-012-0225-0openalex-snapshot
Finite Convergence of the Proximal Point Algorithm for Variational Inequality Problems
inferred← citeshttps://doi.org/10.1007/s11590-019-01397-xopenalex-snapshot
Characterizing the solution set of convex optimization problems without convexity of constraints
inferred← citeshttps://doi.org/10.1007/s11633-012-0646-0openalex-snapshot
Error bound for the generalized complementarity problem with analytic functions
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.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(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.cam.2026.117422openalex-snapshot
Characterizations of solution sets of nonsmooth mathematical programming problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2011.09.032openalex-snapshot
Finite termination of the proximal point algorithm in Banach spaces
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/02331934.2016.1160398openalex-snapshot
Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms
inferred← citeshttps://doi.org/10.1080/02331939408844003openalex-snapshot
Global error bounds for convex quadratic inequality systems *
inferred← citeshttps://doi.org/10.1090/s0002-9939-2011-10883-9openalex-snapshot
On convergence of the proximal point algorithm in Banach spaces
inferred← citeshttps://doi.org/10.1137/0331063openalex-snapshot
Weak Sharp Minima in Mathematical Programming
inferred← citeshttps://doi.org/10.1137/0806024openalex-snapshot
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach
inferred← citeshttps://doi.org/10.1137/21m1428674openalex-snapshot
Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming
inferred← citeshttps://doi.org/10.1137/s036301299222888xopenalex-snapshot
On the Boundedness and Stability of Solutions to the Affine Variational Inequality Problem
inferred← citeshttps://doi.org/10.1137/s0363012994261690openalex-snapshot
Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s0363012998339216openalex-snapshot
Hoffman's Error Bound, Local Controllability, and Sensitivity Analysis
inferred← citeshttps://doi.org/10.1137/s1052623498339739openalex-snapshot
On the Identification of Zero Variables in an Interior-Point Framework
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.1287/moor.23.1.221openalex-snapshot
Nondegeneracy Concepts for Zeros of Piecewise Smooth Functions
inferred← citeshttps://doi.org/10.2172/432434openalex-snapshot
A path-following interior-point algorithm for linear and quadratic problems
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.