Preconditioning indefinite systems in interior point methods for large scale linear optimisation
From MaRDI portal
Publication:3514841
DOI10.1080/10556780701535910zbMath1162.90510OpenAlexW1996982555MaRDI QIDQ3514841
Julian Hall, G. Al-Jeiroudi, Jacek Gondzio
Publication date: 23 July 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/10694322/Preconditioning_indefinite_systems_in_interior_point_methods_for_large_scale_linear_optimisation.pdf
Computational methods for sparse matrices (65F50) Linear programming (90C05) Interior-point methods (90C51)
Related Items
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy, Improving the preconditioning of linear systems from interior point methods, Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems, Recycling basic columns of the splitting preconditioner in interior point methods, Interior point methods 25 years later, An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming, Implementation of an interior point method with basis preconditioning, Using groups in the splitting preconditioner computation for interior point methods, Calmness of partially perturbed linear systems with an application to the central path, Sparsity preserving preconditioners for linear systems in interior-point methods, Null-Space Preconditioners for Saddle Point Systems, Convergence analysis of the inexact infeasible interior-point method for linear optimization, Calmness of linear constraint systems under structured perturbations with an application to the path-following scheme, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, Improving an interior-point approach for large block-angular problems by hybrid preconditioners
Uses Software
Cites Work
- On the augmented system approach to sparse least-squares problems
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Hyper-sparsity in the revised simplex method and how to exploit it
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Constraint Preconditioning for Indefinite Linear Systems
- Symmetric Quasidefinite Matrices
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Solution of large‐scale weighted least‐squares problems
- Pivoting for Size and Sparsity in Linear Programming Inversion Routes
- Methods of conjugate gradients for solving linear systems
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
