The principal pivoting method revisited

DOI10.1007/BF01582264zbMATH Open0716.90095OpenAlexW1978560552MaRDI QIDQ753692FDOQ753692

Authors: R. 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

Recommendations

• scientific article; zbMATH DE number 3312380
• Analysis of the Diagonal Pivoting Method
• Principal component regression revisited
• Principal pivoting method for solving column sufficient complementarity problems
• Pivot vector method and its applications
• Principal pivot transforms: Properties and applications
• A multivariate generalization of Prony's method
• Publication:3026069

zbMATH Keywords

linear complementaritypivotal algebraprincipal pivoting methodsufficient matrices

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Title not available (Why is that?)
• Bimatrix Equilibrium Points and Mathematical Programming
• Nonlinear Programs with Positively Bounded Jacobians
• Sufficient matrices and the linear complementarity problem
• A Probelm in Linear Inequalities
• Title not available (Why is that?)
• A constructive characterization ofQ o-matrices with nonnegative principal minors
• Title not available (Why is that?)

Cited In (28)

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

This page was built for publication: The principal pivoting method revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753692)