On the public citation graph

An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds

https://doi.org/10.1007/bfb0120780
0 signed · 31 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/bf01580658openalex-snapshot
A note on A complementary variant of Lemke's method
inferredcites →https://doi.org/10.1007/bf01584669openalex-snapshot
Projection methods for non-linear programming
inferredcites →https://doi.org/10.1007/bf01585528openalex-snapshot
A complementary variant of Lemke's method for the linear complementary problem
inferredcites →https://doi.org/10.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0343558-6openalex-snapshot
Methods for Modifying Matrix Factorizations
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0388754-8openalex-snapshot
Methods for computing and modifying the 𝐿𝐷𝑉 factors of a matrix
inferredcites →https://doi.org/10.1137/0112033openalex-snapshot
Equilibrium Points of Bimatrix Games
inferredcites →https://doi.org/10.1287/mnsc.17.9.612openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.2307/2005744openalex-snapshot
Methods for Computing and Modifying the LDV Factors of a Matrix

What points at this work

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

inferred← citeshttps://doi.org/10.1002/aic.15425openalex-snapshot
A tribute to professor Roger Sargent: Intellectual leader of process systems engineering
inferred← citeshttps://doi.org/10.1002/rob.4620100606openalex-snapshot
A linear complementarity approach to the articulated multifingered friction gripper
inferred← citeshttps://doi.org/10.1002/zamm.19850650820openalex-snapshot
Ein effektiver Branch and Bound‐Algorithmus für Boolesche quadratische Optimierungsprobleme
inferred← citeshttps://doi.org/10.1007/978-1-4471-2885-4_14openalex-snapshot
Time-Stepping via Complementarity
inferred← citeshttps://doi.org/10.1007/978-90-481-9681-4_5openalex-snapshot
Time-Stepping Schemes and One Step Solvers
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_15openalex-snapshot
Algorithms 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/bfb0113289openalex-snapshot
An extension of Lemke’s method for the solution of a generalized Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1016/0045-7949(92)90348-4openalex-snapshot
A numerical solution of general frictional contact problems by the direct boundary element and mathematical programming approach
inferred← citeshttps://doi.org/10.1016/0098-1354(83)80004-0openalex-snapshot
Methods for quadratic programming: A survey
inferred← citeshttps://doi.org/10.1016/j.aml.2004.01.011openalex-snapshot
Verification for existence of solutions for some generalized obstacle problems
inferred← citeshttps://doi.org/10.1016/j.cam.2003.05.006openalex-snapshot
Numerical verification of solutions for obstacle problems
inferred← citeshttps://doi.org/10.1016/j.camwa.2004.01.008openalex-snapshot
A numerical verification of solutionsof free boundary problems
inferred← citeshttps://doi.org/10.1080/00949658708811021openalex-snapshot
Least squares with inequality restrictions: a symmetric positive-definite linear complementarity problem algorithm
inferred← citeshttps://doi.org/10.1109/robot.2005.1570819openalex-snapshot
Fast Implementation of Lemke’s Algorithm for Rigid Body Contact Simulation
inferred← citeshttps://doi.org/10.1109/simpar.2016.7862401openalex-snapshot
Fast multi-body simulations of robots controlled with error feedback
inferred← citeshttps://doi.org/10.1109/tcad.2010.2049134openalex-snapshot
Time-Stepping Numerical Simulation of Switched Circuits Within the Nonsmooth Dynamical Systems Approach
inferred← citeshttps://doi.org/10.1177/027836499201100202openalex-snapshot
A Linear Complementarity Approach to the Frictionless Gripper Problem
inferred← citeshttps://doi.org/10.1287/mnsc.26.3.282openalex-snapshot
An Implicit Enumeration Algorithm for Quadratic Integer Programming
inferred← citeshttps://doi.org/10.1287/opre.28.3.754openalex-snapshot
A New and Efficient Algorithm for a Class of Portfolio Selection Problems
inferred← citeshttps://doi.org/10.3390/pr7060350openalex-snapshot
Advances in Energy Systems Engineering and Process Systems Engineering in China—A Review Starting from Sargent’s Pioneering Work
inferred← citeshttps://doi.org/10.48550/arxiv.0904.1682openalex-snapshot
Implicit Euler numerical simulations of sliding mode systems
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.