Eigenvalue relations and conditions of matrices arising in linear programming

DOI10.1007/S006070050012MaRDI QIDQ1293458zbMATH OpenOpenAlexFDO

Authors Janos 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

inexact search directioninfeasible-interior-point methodKrylov subspace methodslinear programming

Mathematics Subject Classification ID

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

Recommendations

• A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods
• Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
• Large-Scale Scientific Computing
• Sparsity preserving preconditioners for linear systems in interior-point methods
• Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method

Cited in

(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

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