Eigenvalue relations and conditions of matrices arising in linear programming

DOI10.1007/s006070050012zbMath0946.90046OpenAlexW1986225835MaRDI QIDQ1293458

J. Korzak

Publication date: 28 June 1999

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingKrylov subspace methodsinfeasible-interior-point methodinexact search direction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Interior-point methods (90C51)

Related Items (1)

Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number

This page was built for publication: Eigenvalue relations and conditions of matrices arising in linear programming