Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
From MaRDI portal
Publication:2643622
DOI10.1007/s10589-006-9009-5zbMath1148.90350OpenAlexW2146296113MaRDI QIDQ2643622
Silvana Bocanegra, F. F. Campos, Aurelio Ribeiro Leite Oliveira
Publication date: 27 August 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-9009-5
Related Items (24)
A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming ⋮ Crash start of interior point methods ⋮ Improving the preconditioning of linear systems from interior point methods ⋮ A new proposal to improve the early iterations in the interior point method ⋮ A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods ⋮ General-purpose preconditioning for regularized interior point methods ⋮ A New Approach to the Splitting Factor Preconditioner Applied to Linear Programming Problems ⋮ Recycling basic columns of the splitting preconditioner in interior point methods ⋮ Interior point methods 25 years later ⋮ 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 ⋮ Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods ⋮ Sparsity preserving preconditioners for linear systems in interior-point methods ⋮ A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models ⋮ Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method ⋮ Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming ⋮ An inexact interior-point method for system analysis ⋮ 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 ⋮ Computing the Splitting Preconditioner for Interior Point Method Using an Incomplete Factorization Approach ⋮ Convergence analysis of the inexact infeasible interior-point method for linear optimization ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization ⋮ Unnamed Item ⋮ Improving an interior-point approach for large block-angular problems by hybrid preconditioners
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- QAPLIB-A quadratic assignment problem library
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Location, scheduling, design and integer programming
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Multiple centrality corrections in a primal-dual method for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- Numerical solution of saddle point problems
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Preconditioners for Indefinite Systems Arising in Optimization
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- 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
- 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
- Solution of large‐scale weighted least‐squares problems
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- On Best Conditioned Matrices
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
This page was built for publication: Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
