On the public citation graph

The principal pivoting method revisited

https://doi.org/10.1007/bf01582264
0 signed · 45 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/bf02591696openalex-snapshot
A constructive characterization ofQ o-matrices with nonnegative principal minors
inferredcites →https://doi.org/10.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1016/0024-3795(89)90463-1openalex-snapshot
Sufficient matrices and the linear complementarity problem
inferredcites →https://doi.org/10.1057/jors.1967.61openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1112/plms/s3-16.1.519openalex-snapshot
A Probelm in Linear Inequalities
inferredcites →https://doi.org/10.1137/0114012openalex-snapshot
Nonlinear Programs with Positively Bounded Jacobians
inferredcites →https://doi.org/10.1287/mnsc.11.7.681openalex-snapshot
Bimatrix Equilibrium Points and Mathematical Programming
inferredcites →https://doi.org/10.21236/ad0605549openalex-snapshot
NONLINEAR PROGRAMS WITH POSITIVELY BOUNDED JACOBIANS

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_398openalex-snapshot
Principal Pivoting Methods for Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1007/0-387-24276-7_18openalex-snapshot
Linear Complementarity Since 1978
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_524openalex-snapshot
Principal Pivoting Methods for Linear Complementarity Problems
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-46802-5_18openalex-snapshot
Generalized monotonicity — a survey
inferred← citeshttps://doi.org/10.1007/978-981-10-4642-1_15openalex-snapshot
Finiteness of Criss-Cross Method in Complementarity Problem
inferred← citeshttps://doi.org/10.1007/978-981-13-3059-9_1openalex-snapshot
A Unified Framework for a Class of Mathematical Programming Problems
inferred← citeshttps://doi.org/10.1007/978-981-97-8907-8_15openalex-snapshot
Lemke’s Algorithm and a Class of Convex Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-981-97-8907-8_7openalex-snapshot
Complementarity Problems and Its Relation with Optimization Theory
inferred← citeshttps://doi.org/10.1007/bf02096264openalex-snapshot
Pivot rules for linear programming: A survey on recent theoretical developments
inferred← citeshttps://doi.org/10.1007/s10107-005-0639-7openalex-snapshot
Sufficient matrices belong to L
inferred← citeshttps://doi.org/10.1007/s10479-013-1459-4openalex-snapshot
More results on column sufficiency property in Euclidean Jordan algebras
inferred← citeshttps://doi.org/10.1007/s10479-014-1622-6openalex-snapshot
Properties of some matrix classes based on principal pivot transform
inferred← citeshttps://doi.org/10.1007/s10479-022-04975-yopenalex-snapshot
On solving parametric multiobjective quadratic programs with parameters in general locations
inferred← citeshttps://doi.org/10.1007/s10898-009-9441-zopenalex-snapshot
A field guide to the matrix classes found in the literature of the linear complementarity problem
inferred← citeshttps://doi.org/10.1007/s10957-023-02280-7openalex-snapshot
Sufficient Matrices: Properties, Generating and Testing
inferred← citeshttps://doi.org/10.1007/s44198-022-00029-wopenalex-snapshot
The Reduced Order Method for Solving the Linear Complementarity Problem with an M-Matrix
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90410-copenalex-snapshot
Two characterizations of sufficient matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90124-7openalex-snapshot
The linear complimentarity problem, sufficient matrices, and the criss-cross method
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90506-jopenalex-snapshot
Notes on sufficient matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00058-1openalex-snapshot
Criteria for sufficient matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(94)00170-7openalex-snapshot
P*-Matrices Are Just Sufficient
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00703-2openalex-snapshot
Determining the handicap of a sufficient matrix
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.01.033openalex-snapshot
Pricing American drawdown options under Markov models
inferred← citeshttps://doi.org/10.1016/j.laa.2004.11.023openalex-snapshot
Principal pivot transforms of some classes of matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2009.01.010openalex-snapshot
New characterizations of row sufficient matrices
inferred← citeshttps://doi.org/10.1016/j.laa.2010.09.046openalex-snapshot
On singular N0 -matrices and the class Q
inferred← citeshttps://doi.org/10.1016/j.laa.2016.01.045openalex-snapshot
On hidden Z-matrices and the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00247-0openalex-snapshot
On the classes of fully copositive and fully semimonotone matrices
inferred← citeshttps://doi.org/10.1016/s0166-218x(97)00143-1openalex-snapshot
EP theorems and linear complementarity problems
inferred← citeshttps://doi.org/10.1080/02331939408843953openalex-snapshot
A procedure for the one-parametric linear complementarity problem
inferred← citeshttps://doi.org/10.1080/03081087.2012.719507openalex-snapshot
On weak generalized positive subdefinite matrices and the linear complementarity problem
inferred← citeshttps://doi.org/10.1080/21680566.2026.2737228openalex-snapshot
Efficient sensitivity analysis in dynamic continuum user-equilibrium models for urban cities
inferred← citeshttps://doi.org/10.1137/0612047openalex-snapshot
Iterative Descent Algorithms for a Row Sufficient Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1137/0613068openalex-snapshot
Least-Index Resolution of Degeneracy in Linear Complementarity Problems with Sufficient Matrices
inferred← citeshttps://doi.org/10.1137/0804019openalex-snapshot
On Optimization Problems with Variational Inequality Constraints
inferred← citeshttps://doi.org/10.1155/2019/2976768openalex-snapshot
The Block Principal Pivoting Algorithm for the Linear Complementarity Problem with an M -Matrix
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.