A QMR-based interior-point algorithm for solving linear programs
From MaRDI portal
Recommendations
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
- Symmetric indefinite systems for interior point methods
Cites work
- A new polynomial-time algorithm for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- A QMR-based interior-point algorithm for solving linear programs
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- An implementation of Karmarkar's algorithm for linear programming
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
- Computational experience with a primal-dual interior point method for linear programming
- Computational results of an interior point algorithm for large scale linear programming
- Convergence of a class of inexact interior-point algorithms for linear programs
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 4072729 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 663834 (Why is no real title available?)
- scientific article; zbMATH DE number 740107 (Why is no real title available?)
- Interior path following primal-dual algorithms. I: Linear programming
- Methods of conjugate gradients for solving linear systems
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Preconditioners for Indefinite Systems Arising in Optimization
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Symmetric indefinite systems for interior point methods
Cited in
(16)- A QMR-based interior-point algorithm for solving linear programs
- Inexact interior-point method
- Symbiosis between linear algebra and optimization
- Symmetric indefinite systems for interior point methods
- A modified SSOR-like preconditioner for non-Hermitian positive definite matrices
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- On the convergence of a predictor-corrector variant algorithm
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Solving scalarized multi-objective network flow problems using an interior point method
- Matrix-free interior point method
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- On barrier and modified barrier multigrid methods for three-dimensional topology optimization
- QQMR: a structure preserving quaternion quasi-minimal residual method
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
This page was built for publication: A QMR-based interior-point algorithm for solving linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361110)
