Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A short proof of finiteness of Murty's principal pivoting algorithm

From MaRDI portal
Publication:1262225
Jump to:navigation, search

DOI10.1007/BF01585743zbMath0685.90094OpenAlexW4243920308MaRDI QIDQ1262225

Jiří Rohn

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


zbMATH Keywords

finitenesslinear complementarityP-matrixMurty's principal pivoting algorithm


Mathematics Subject Classification ID

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

  • Unnamed Item
  • Computational complexity of complementary pivot methods


This page was built for publication: A short proof of finiteness of Murty's principal pivoting algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1262225&oldid=13361185"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 10:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki