Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
From MaRDI portal
Publication:665950
Recommendations
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- Final iterations in interior point methods – preconditioned conjugate gradients and modified search directions
- Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
Cites work
- scientific article; zbMATH DE number 515933 (Why is no real title available?)
- A family of linear programming algorithms based on an algorithm by von Neumann
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
- 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
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- An implementation of Karmarkar's algorithm for linear programming
- An improved incomplete Cholesky factorization
- Constraint Preconditioning for Indefinite Linear Systems
- Further development of multiple centrality correctors for interior point methods
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- Inexact constraint preconditioners for linear systems arising in interior point methods
- Multiple centrality corrections in a primal-dual method for linear programming
- On Best Conditioned Matrices
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- PCx: an interior-point code for linear programming
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- The effect of ordering on preconditioned conjugate gradients
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
Cited in
(6)- Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques
- Sparsity preserving preconditioners for linear systems in interior-point methods
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods
- Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming
This page was built for publication: Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q665950)
