On the public citation graph
Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
0 signed · 48 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/bf01580248openalex-snapshot
Classes of functions and feasibility conditions in nonlinear complementarity problems
inferredcites →https://doi.org/10.1007/bf01580671openalex-snapshot
Linear complementarity problems solvable by A single linear program
inferredcites →https://doi.org/10.1007/bf01582097openalex-snapshot
On a class of least-element complementarity problems
inferredcites →https://doi.org/10.1007/bf01582119openalex-snapshot
On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
inferredcites →https://doi.org/10.1007/bf01584990openalex-snapshot
Monotone solutions of the parametric linear complementarity problem
inferredcites →https://doi.org/10.1007/bf01588254openalex-snapshot
Computational complexity of LCPs associated with positive definite symmetric matrices
inferredcites →https://doi.org/10.1007/bf01589334openalex-snapshot
A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
inferredcites →https://doi.org/10.1007/bf01696240openalex-snapshot
ИССЛЕДОВАНИЕ НЕКОТО РЫХ СЛОЖНЫХ ПОЛУПРОВОДНИКОВЫХ Т ВДРДЫХ РАСТВОРОВ И СОЕДИНЕНИЙ НА ОСНОВ Е ИНДИЯ
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bf02591869openalex-snapshot
Computational complexity of Van der Heyden's variable dimension algorithm and Dantzig-Cottle's principal pivoting method for solving LCP's
inferredcites →https://doi.org/10.1007/bfb0120782openalex-snapshot
Computational complexity of complementary pivot methods
inferredcites →https://doi.org/10.1007/bfb0120784openalex-snapshot
On solving linear complementarity problems as linear programs
inferredcites →https://doi.org/10.1016/0024-3795(74)90066-4openalex-snapshot
Manifestations of the Schur complement
inferredcites →https://doi.org/10.1016/0024-3795(78)90077-0openalex-snapshot
On cone orderings and the linear complementarity problem
inferredcites →https://doi.org/10.1016/0024-3795(79)90103-4openalex-snapshot
Hidden Z-matrices with positive principal minors
inferredcites →https://doi.org/10.1016/0024-3795(81)90288-3openalex-snapshot
On diagonal dominance in linear complementarity
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/b978-0-12-597050-1.50016-6openalex-snapshot
Recent Results on Complementarity Problems
inferredcites →https://doi.org/10.1016/c2013-0-10361-3openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
inferredcites →https://doi.org/10.1287/mnsc.11.7.681openalex-snapshot
Bimatrix Equilibrium Points and Mathematical Programming
inferredcites →https://doi.org/10.1287/opre.28.3.754openalex-snapshot
A New and Efficient Algorithm for a Class of Portfolio Selection Problems
inferredcites →https://doi.org/10.21136/cmj.1962.100526openalex-snapshot
On matrices with non-positive off-diagonal elements and positive principal minors
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-94-009-0369-2_15openalex-snapshot
Algorithms for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-981-19-9307-7_12openalex-snapshot
On Some Properties of K-type Block Matrices in the Context of Complementarity Problem
inferred← citeshttps://doi.org/10.1007/bf02592069openalex-snapshot
Two counterexamples on the polynomial solvability of the linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s10107-005-0671-7openalex-snapshot
A class of polynomially solvable linear complementarity problems
inferred← citeshttps://doi.org/10.1007/s10107-016-0996-4openalex-snapshot
Some LCPs solvable in strongly polynomial time with Lemke’s algorithm
inferred← citeshttps://doi.org/10.1007/s10107-021-01766-4openalex-snapshot
Linear-step solvability of some folded concave and singly-parametric sparse optimization problems
inferred← citeshttps://doi.org/10.1007/s10107-025-02254-9openalex-snapshot
Logarithmic integral optimization via adaptive importance sampling based surrogation methods
inferred← citeshttps://doi.org/10.1007/s101070100268openalex-snapshot
Randomized pivot algorithms for P-matrix linear complementarity problems
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90264-wopenalex-snapshot
A class of linear complementarity problems solvable in polynomial time
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90256-9openalex-snapshot
On some classes of matrices related to solving linear complementarity problems as linear programs
inferred← citeshttps://doi.org/10.1016/j.automatica.2020.109429openalex-snapshot
Linear complementarity model predictive control with limited iterations for box-constrained problems
inferred← citeshttps://doi.org/10.1016/j.dam.2013.07.017openalex-snapshot
Counting unique-sink orientations
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.03.010openalex-snapshot
Enumeration of PLCP-orientations of the 4-cube
inferred← citeshttps://doi.org/10.1016/j.laa.2007.05.004openalex-snapshot
Good hidden P-matrix sandwiches
inferred← citeshttps://doi.org/10.1016/j.laa.2008.06.003openalex-snapshot
Generalizations of the hidden Minkowski property
inferred← citeshttps://doi.org/10.1016/j.orl.2012.08.013openalex-snapshot
A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00243-3openalex-snapshot
On the convergence of the block principal pivotal algorithm for the LCP
inferred← citeshttps://doi.org/10.1080/18824889.2023.2225922openalex-snapshot
Bounded iteration for multiple box constraints on linear complementarity model predictive control and its application to vehicle steering control
inferred← citeshttps://doi.org/10.1137/0610017openalex-snapshot
Geometric Properties of Hidden Minkowski Matrices
inferred← citeshttps://doi.org/10.1137/0610020openalex-snapshot
Continuous Homotopies for the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/21m1463793openalex-snapshot
Some Strongly Polynomially Solvable Convex Quadratic Programs with Bounded Variables
inferred← citeshttps://doi.org/10.3929/ethz-a-005779065openalex-snapshot
On classes of unique-sink orientations arising from pivoting in linear complementarity
inferred← citeshttps://doi.org/10.3929/ethz-a-007604201openalex-snapshot
A fresh look at the complexity of pivoting in linear complementarity
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1827openalex-snapshot
A Strongly Polynomial Reduction for Linear Programs over Grids
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.