A short proof of finiteness of Murty's principal pivoting algorithm
From MaRDI portal
Publication:1262225
DOI10.1007/BF01585743zbMath0685.90094OpenAlexW4243920308MaRDI QIDQ1262225
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/bf01585743
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (3)
On extremal behaviors of Murty's least index method ⋮ A family of second-order methods for convex \(\ell _1\)-regularized optimization ⋮ Conjugate gradient method for the linear complementarity problem withs-matrix
Cites Work
This page was built for publication: A short proof of finiteness of Murty's principal pivoting algorithm