A QMR-based interior-point algorithm for solving linear programs
From MaRDI portal
Publication:1361110
DOI10.1007/BF02614383zbMath0881.90094MaRDI QIDQ1361110
Roland W. Freund, Florian Jarre
Publication date: 23 July 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
symmetric indefinite linear systemimplementation of interior-point methodsindefinite preconditionersquasi-minimal residual iteration
Related Items (13)
On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming ⋮ A QMR-based interior-point algorithm for solving linear programs ⋮ Inexact interior-point method ⋮ Matrix-free interior point method ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ Solving scalarized multi-objective network flow problems using an interior point method ⋮ A modified SSOR-like preconditioner for non-Hermitian positive definite matrices ⋮ On Barrier and Modified Barrier Multigrid Methods for Three-Dimensional Topology Optimization ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ Symbiosis between linear algebra and optimization ⋮ On the convergence of a predictor-corrector variant algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Interior path following primal-dual algorithms. I: Linear programming
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Computational results of an interior point algorithm for large scale linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Solving symmetric indefinite systems in an interior-point method for linear programming
- A QMR-based interior-point algorithm for solving linear programs
- Symmetric indefinite systems for interior point methods
- An implementation of Karmarkar's algorithm for linear programming
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- Preconditioners for Indefinite Systems Arising in Optimization
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Solution of Sparse Indefinite Systems of Linear Equations
- An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Methods of conjugate gradients for solving linear systems
This page was built for publication: A QMR-based interior-point algorithm for solving linear programs
