Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
From MaRDI portal
Publication:2219452
DOI10.1007/s11075-020-00893-xzbMath1456.65039OpenAlexW3010109591MaRDI QIDQ2219452
Petra Maria Bartmeyer, Silvana Bocanegra, Aurelio Ribeiro Leite Oliveira
Publication date: 20 January 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-00893-x
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interior point methods 25 years later
- Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
- Interior-point methods
- Improving the preconditioning of linear systems from interior point methods
- Using groups in the splitting preconditioner computation for interior point methods
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Preconditioning techniques for large linear systems: A survey
- Application of a GPU-accelerated hybrid preconditioned conjugate gradient approach for large 3D problems in computational geomechanics
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- An analysis of the Rayleigh--Ritz method for approximating eigenspaces
- Numerical solution of saddle point problems
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- On the Implementation of a Primal-Dual Interior Point Method
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- An improved incomplete Cholesky factorization
- An Efficient Solver for Multi--Right-Hand-Side Linear Systems Based on the CCCG($\eta$) Method with Applications to Implicit Time-Dependent Partial Differential Equations
- PCx: an interior-point code for linear programming
- A repository of convex quadratic programming problems
- Incomplete Cholesky Factorizations with Limited Memory
- Ritz Value Localization for Non-Hermitian Matrices
- Preconditioning
- Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
