A QMR-based interior-point algorithm for solving linear programs
type: Item
instance of: scholarly article
title: A QMR-based interior-point algorithm for solving linear programs
zbMATH Open document ID: 0881.90094
DOI: 10.1007/BF02614383
author: Roland W. Freund
author: Florian Jarre
published in: Mathematical Programming. Series A. Series B
publication date: 1997-07-23T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1038508
zbMATH Keywords: symmetric indefinite linear system
zbMATH Keywords: quasi-minimal residual iteration
zbMATH Keywords: implementation of interior-point methods
zbMATH Keywords: indefinite preconditioners
MaRDI profile type: Publication
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: A survey of preconditioned iterative methods for linear systems of algebraic equations
cites work: Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
cites work: Solving symmetric indefinite systems in an interior-point method for linear programming
cites work: Q4328442
cites work: Q4309409
cites work: Q4016503
cites work: An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
cites work: Convergence of a class of inexact interior-point algorithms for linear programs
cites work: QMR: A quasi-minimal residual method for non-Hermitian linear systems
cites work: An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
cites work: Preconditioners for Indefinite Systems Arising in Optimization
cites work: Methods of conjugate gradients for solving linear systems
cites work: A new polynomial-time algorithm for linear programming
cites work: Computational results of an interior point algorithm for large scale linear programming
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: Q3491304
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
cites work: Q4206561
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: Solution of Sparse Indefinite Systems of Linear Equations
cites work: Q3804467
cites work: Symmetric indefinite systems for interior point methods
description: scientific article; zbMATH DE number 1038508