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

Computing projections for the Karmarkar algorithm

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

DOI10.1016/0024-3795(91)90272-XzbMath0729.65043MaRDI QIDQ806966

Kathryn Turner

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)


zbMATH Keywords

linear programmingsparsityKarmarkar algorithm


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)


Related Items

Loss and retention of accuracy in affine scaling methods, The role of the augmented system in interior point methods, LOQO:an interior point code for quadratic programming, Solving symmetric indefinite systems in an interior-point method for linear programming


Uses Software

  • NETLIB LP Test Set
  • MA27


Cites Work

  • Unnamed Item
  • A new polynomial-time algorithm for linear programming
  • An extension of Karmarkar's algorithm for linear programming using dual variables
  • The Multifrontal Solution of Indefinite Sparse Symmetric Linear
  • A variable-metric variant of the Karmarkar algorithm for linear programming
  • The Factorization of Sparse Symmetric Indefinite Matrices
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:806966&oldid=12731480"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 12:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki