Improving the preconditioning of linear systems from interior point methods
From MaRDI portal
Publication:1652361
DOI10.1016/j.cor.2017.04.005zbMath1458.90634OpenAlexW2606969936MaRDI QIDQ1652361
Luciana Casacio, Aurelio Ribeiro Leite Oliveira, Christiano Lyra, Cecilia Orellana Castro
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.04.005
Linear programming (90C05) Interior-point methods (90C51) Numerical computation of matrix norms, conditioning, scaling (65F35) Preconditioners for iterative methods (65F08)
Related Items (5)
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ A new proposal to improve the early iterations in the interior point method ⋮ Recycling basic columns of the splitting preconditioner in interior point methods ⋮ Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming ⋮ Using groups in the splitting preconditioner computation for interior point methods
Uses Software
Cites Work
- Unnamed Item
- Interior point methods 25 years later
- Sparsity preserving preconditioners for linear systems in interior-point methods
- A variation on the interior point method for linear programming using the continued iteration
- 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
- Inexact constraint preconditioners for linear systems arising in interior point methods
- Using constraint preconditioners with regularized saddle-point problems
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation
- Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- PCx: an interior-point code for linear programming
- Constraint Preconditioning for Indefinite Linear Systems
- Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- On the Automatic Scaling of Matrices for Gaussian Elimination
This page was built for publication: Improving the preconditioning of linear systems from interior point methods
