The principal pivoting method revisited

From MaRDI portal
Publication:753692

DOI10.1007/BF01582264zbMath0716.90095OpenAlexW1978560552MaRDI QIDQ753692

Richard W. Cottle

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582264



Related Items

More results on column sufficiency property in Euclidean Jordan algebras, Properties of some matrix classes based on principal pivot transform, Criteria for sufficient matrices, On semimonotone star matrices and linear complementarity problem, The reduced order method for solving the linear complementarity problem with an \(M\)-matrix, On singular \(N_{0}\)-matrices and the class \(Q\), EP theorems and linear complementarity problems, On solving parametric multiobjective quadratic programs with parameters in general locations, Finiteness of Criss-Cross Method in Complementarity Problem, Two characterizations of sufficient matrices, Determining the handicap of a sufficient matrix, On the classes of fully copositive and fully semimonotone matrices, A field guide to the matrix classes found in the literature of the linear complementarity problem, Sufficient matrices belong to \(L\)., Principal pivot transforms of some classes of matrices, Pricing American drawdown options under Markov models, On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem, The linear complementarity problem, sufficient matrices, and the criss- cross method, New characterizations of row sufficient matrices, The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix, On weak generalized positive subdefinite matrices and the linear complementarity problem, Notes on sufficient matrices, Pivot rules for linear programming: A survey on recent theoretical developments, A procedure for the one-parametric linear complementarity problem



Cites Work